New codes via the lengthening of BCH codes with UEP codes

DOI10.1006/ffta.1999.0245zbMath1018.94029OpenAlexW2057215793MaRDI QIDQ1808843

Yves Edel, L. M. G. M. Tolhuizen, Juergen Bierbrauer

Publication date: 4 September 2003

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/ffta.1999.0245

zbMATH Keywords

BCH codeslengtheningunequal error protection

Mathematics Subject Classification ID

Cyclic codes (94B15)

Related Items (3)

Quaternary Unequal Error Protection Codes ⋮ Algorithms for computing parameters of graph-based extensions of BCH codes ⋮ Dense sphere packings from new codes

Cites Work

• Unnamed Item
• Unnamed Item
• Methods of code lengthening
• Extending and lengthening BCH codes.
• Two topics on linear unequal error protection codes: Bounds on their length and cyclic code classes
• Linear unequal error protection codes
• Optimal encodings of linear block codes for unequal error protection
• New code parameters from Reed-Solomon subfield codes
• Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes

This page was built for publication: New codes via the lengthening of BCH codes with UEP codes