Finding short and light codewords in BCH codes

DOI10.1109/18.746802MaRDI QIDQ4701262zbMATH OpenOpenAlexFDO

Authors E. Hernquist, Donald W. Newhart, Richard A. Stong

Publication date 21 November 1999

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/18.746802

zbMATH Keywords

cyclic redundancy codesserial implementationbinary narrow-sense BCH codes

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• Encoding and decoding of BCH codes using light and short codewords
• scientific article; zbMATH DE number 7008108
• scientific article; zbMATH DE number 149700
• Efficient Software-Based Encoding and Decoding of BCH Codes
• A Class of Narrow-Sense BCH Codes
• scientific article; zbMATH DE number 1188986
• BCH codes with minimum distance proportional to code length
• Minimal codewords of the primitive BCH codes
• BCH convolutional codes
• Decoding Goppa codes with a BCH decoder (Corresp.)

Cited in

(5)

• Fast calculation of the number of minimum-weight words of CRC codes
• scientific article; zbMATH DE number 4112524 (Why is no real title available?)
• Encoding and decoding of BCH codes using light and short codewords
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
• Algorithms for computing parameters of graph-based extensions of BCH codes

This page was built for publication: Finding short and light codewords in BCH codes

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