Extending and lengthening BCH codes.

DOI10.1006/FFTA.1997.0188MaRDI QIDQ1266406zbMATH OpenOpenAlexFDO

Authors Yves Edel, Jürgen 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)

Recommendations

• New codes via the lengthening of BCH codes with UEP codes
• Twisted BCH-codes
• Adding Two Information Symbols to Certain Nonbinary BCH Codes and Some Applications
• Two decyclical lengthening methods for block codes
• Some binary BCH codes with length \(n = 2^m + 1\)

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• An updated table of minimum-distance bounds for binary linear codes
• Construction of orthogonal arrays
• New binary codes
• New code parameters from Reed-Solomon subfield codes
• On subfield subcodes of modified Reed-Solomon codes (Corresp.)
• Some Remarks on BCH Bounds and Minimum Weights of Binary Primitive BCH Codes
• Studying the locator polynomials of minimum weight codewords of BCH codes

Cited in

(7)

• New codes via the lengthening of BCH codes with UEP codes
• Dense sphere packings from new codes
• scientific article; zbMATH DE number 978785 (Why is no real title available?)
• Some codes related to BCH-codes of low dimension
• Adding Two Information Symbols to Certain Nonbinary BCH Codes and Some Applications
• Algorithms for computing parameters of graph-based extensions of BCH codes
• Preparata codes through lattices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1266406)