The properties and parameters of generic Bose – Chaudhuri – Hocquenghem codes
| Autor: | A. V. Kushnerov, V. A. Lipinski, M. N. Koroliova |
|---|---|
| Rok vydání: | 2020 |
| Předmět: |
010302 applied physics
Discrete mathematics Computer science General Mathematics 010102 general mathematics General Physics and Astronomy 01 natural sciences Constructive Finite field Computational Theory and Mathematics 0103 physical sciences 0101 mathematics Error detection and correction Hamming code BCH code |
| Zdroj: | Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series. 56:157-165 |
| ISSN: | 2524-2415 1561-2430 |
| DOI: | 10.29235/1561-2430-2020-56-2-157-165 |
| Popis: | The Bose – Chaudhuri – Hocquenghem type of linear cyclic codes (BCH codes) is one of the most popular and widespread error-correcting codes. Their close connection with the theory of Galois fields gave an opportunity to create a theory of the norms of syndromes for BCH codes, namely, syndrome invariants of the G-orbits of errors, and to develop a theory of polynomial invariants of the G-orbits of errors. This theory as a whole served as the basis for the development of effective permutation polynomial-norm methods and error correction algorithms that significantly reduce the influence of the selector problem. To date, these methods represent the only approach to error correction with non-primitive BCH codes, the multiplicity of which goes beyond design boundaries. This work is dedicated to a special error-correcting code class – generic Bose – Chaudhuri – Hocquenghem codes or simply GBCH-codes. Sufficiently accurate evaluation of the quantity of such codes in each length was produced during our work. We have investigated some properties and connections between different GBCH-codes. Special attention was devoted to codes with constructive distances of 3 and 5, as those codes are usual for practical use. Their almost complete description is given in the range of lengths from 7 to 107. The paper contains a fairly clear theoretical classification of GBCH-codes. Special attention is paid to the corrective capabilities of the codes of this class, namely, to the calculation of the minimal distances of these codes with various parameters. The codes are found whose corrective capabilities significantly exceed those of the well-known GBCH-codes with the same design parameters. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|