New code parameters from Reed-Solomon subfield codes
IEEE Transactions on Information Theory
Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
IEEE Transactions on Information Theory
Linear unequal error protection codes
IEEE Transactions on Information Theory
Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes
IEEE Transactions on Information Theory
A method for extending binary linear codes (Corresp.)
IEEE Transactions on Information Theory
Extending and LengtheningBCHCodes
Finite Fields and Their Applications
Dense Sphere Packings from New Codes
Journal of Algebraic Combinatorics: An International Journal
Algorithms for computing parameters of graph-based extensions of BCH codes
Journal of Discrete Algorithms
An Algorithm for BCH Codes Extended with Finite State Automata
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Quaternary Unequal Error Protection Codes
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
An Algorithm for BCH Codes Extended with Finite State Automata
Fundamenta Informaticae - Workshop on Combinatorial Algorithms
Hi-index | 0.00 |
We describe a code lengthening technique that uses unequal error protection codes as suffix codes and combine it with iteration of the conventional Construction X. By applying this technique to BCH codes, we obtain five new binary codes, 13 new ternary codes, and 13 new quarternary codes. An improvement of Construction XX yields two new ternary codes.