scientific article; zbMATH DE number 1498783

MaRDI QIDQ4500973zbMATH OpenFDO

Authors Peter Kazakov, Tsonka Stefanova Baicheva, Stefan Dodunekov

Publication date 3 September 2000

zbMATH Keywords

CRC codescyclic redundancy-check codesgenerator polynomialsgood codesproper codes

Mathematics Subject Classification ID

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

Review text

Binary cyclic redundancy-check (CRC) codes are considered. They are shortened cyclic codes. CRC codes admit quite simple error detection. All the polynomials presented as irreducible polynomials of degree 15 multiplied by \(x+1\) are studied. The polynomials are suitable for generator polynomials for CRC codes. Such characteristics as undetected errors probability, goodness, properness, and minimum distance are computed for the codes. A comparison with known standards is presented. For the entire collection see [Zbl 0918.00043].

Recommendations

• A Comparison of Some Error Detecting CRC Code Standards
• On the binary CRC codes used in the HARQ scheme of the LTE standard
• Finding cyclic redundancy check polynomials for multilevel systems
• Fast calculation of the number of minimum-weight words of CRC codes
• Computing the probability of undetected error for shortened cyclic codes

Cited in

(4)

• Finding cyclic redundancy check polynomials for multilevel systems
• A method for updating a cyclic redundancy code
• On the binary CRC codes used in the HARQ scheme of the LTE standard
• A survey on proper codes

This page was built for publication:

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