Fast calculation of the number of minimum-weight words of CRC codes

DOI10.1109/18.915680MaRDI QIDQ4544555zbMATH OpenOpenAlexFDO

Authors Peter Kazakov

Publication date 4 August 2002

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

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

zbMATH Keywords

cycle redundancy check codesHamming codeminimum distanceminimum-weight wordsshortened binary cyclic codesundetected error probability

Mathematics Subject Classification ID

Cyclic codes (94B15)

Recommendations

• Computing the probability of undetected error for shortened cyclic codes
• scientific article; zbMATH DE number 1426187
• Computation of the weight distribution of CRC codes
• Finding short and light codewords in BCH codes
• A probabilistic algorithm for computing minimum weights of large error-correcting codes

Cited in

(5)

• Number of minimal-weight words in block codes
• Computing the probability of undetected error for shortened cyclic codes
• scientific article; zbMATH DE number 1498783 (Why is no real title available?)
• On the binary CRC codes used in the HARQ scheme of the LTE standard
• Computation of the weight distribution of CRC codes

This page was built for publication: Fast calculation of the number of minimum-weight words of CRC codes

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