Open AccessGeneric BCH codes. Polynomial-norm error decoding
Author(s) -
А. В. Кушнеров,
V. A. Lipnitski
Publication year - 2020
Publication title -
žurnal belorusskogo gosudarstvennogo universiteta. matematika, informatika/žurnal belorusskogo gosudarstvennogo universiteta. matematika, informatika
Language(s) - English
Resource type - Journals
eISSN - 2617-3956
pISSN - 2520-6508
DOI - 10.33581/2520-6508-2020-2-36-48
Subject(s) - bch code , polynomial code , polynomial , norm (philosophy) , error detection and correction , reed–solomon error correction , decoding methods , generalization , computer science , block code , mathematics , arithmetic , discrete mathematics , linear code , algorithm , mathematical analysis , political science , law
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.