Abstract
A cyclic code is called single-syndrome decodable if its decoding up to error-correcting capability is completely based on the single syndrome. This letter proposes a construction method of the unusual general error locator polynomial (GELP) for the triple- and quadruple-error-correcting single-syndrome decodable cyclic (SSDC) codes and gives an upper bound on the computational complexity of the unusual GELP. Both theoretical and experimental results show that the unusual GELP has lower computational complexity than the conventional GELP for triple-error-correcting SSDC codes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.