Extending and lengthening BCH codes.

DOI10.1006/FFTA.1997.0188zbMath1053.94571OpenAlexW2466200538MaRDI QIDQ1266406

Yves Edel, Juergen Bierbrauer

Publication date: 1997

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

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Related Items (4)

Algorithms for computing parameters of graph-based extensions of BCH codes ⋮ New codes via the lengthening of BCH codes with UEP codes ⋮ Dense sphere packings from new codes ⋮ Some codes related to BCH-codes of low dimension

Cites Work

• Construction of orthogonal arrays
• Studying the locator polynomials of minimum weight codewords of BCH codes
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• An updated table of minimum-distance bounds for binary linear codes
• New binary codes
• New code parameters from Reed-Solomon subfield codes
• Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
• Unnamed Item

This page was built for publication: Extending and lengthening BCH codes.