Abstract
A general key equation based on elementary symmetric functions is developed for decoding some binary error control codes. Here, the syndrome is obtained by computing the elementary symmetric functions (instead of the power-sums) of the received word. A new class of codes is introduced in this paper which can correct up to t <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">0</sub> 0 rarr 1 errors and, simultaneously, up to t <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sub> 1 rarr 0 errors. The new key equation can be used to decode this new class of codes and some known codes such as some t-asymmetric error correcting (t-AEC) codes, the t-symmetric error correcting (t-SEC) BCH codes and Goppa codes. Some generalizations to the non binary case are also given.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
