Generic BCH codes. Polynomial-norm error decoding

Abstract

The classic Bose – Chaudhuri – Hocquenghem (BCH) codes is famous and well-studied part in the theory of error-correcting codes. Generalization of BCH codes allows us to expand the range of activities in the practical correction of errors. Some generic BCH codes are able to correct more errors than classic BCH code in one message block. So it is important to provide appropriate method of error correction. After our investigation it was found that polynomial-norm method is most convenient and effective for that task. The result of the study was a model of a polynomial-norm decoder for a generic BCH code at length 65.

Keywords

• error correcting codes
• bose – chaudhuri – hocquenghem codes
• automorphisms of codes
• norm decoding method
• polynomial-norm decoding method