Computing the probability of undetected error for shortened cyclic codes

DOI10.1109/26.135719MaRDI QIDQ4004658zbMATH OpenOpenAlexFDO

Authors V. K. Agarwal, André Ivanov

Publication date 27 September 1992

Published in IEEE Transactions on Communications (Search for Journal in Brave)

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

zbMATH Keywords

burst errorscode block lengthsCyclic codeserror probabilitiesgenerator polynomiallinear block codesprobability of an undetected errortime complexity

Mathematics Subject Classification ID

Cyclic codes (94B15) Error probability in coding theory (94B70)

Recommendations

• On computing undetected error probabilities on the Gilbert channel
• Undetected error probabilities of codes for single-error correction and error detection
• On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory
• Fast calculation of the number of minimum-weight words of CRC codes
• Concerning a bound on undetected error probability (Corresp.)

Cited in

(8)

• On computing undetected error probabilities on the Gilbert channel
• Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts Codes
• On the monotonic property of the probability of undetected error for a shortened code
• scientific article; zbMATH DE number 1498783 (Why is no real title available?)
• Fast calculation of the number of minimum-weight words of CRC codes
• On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory
• scientific article; zbMATH DE number 1420993 (Why is no real title available?)
• On the binary CRC codes used in the HARQ scheme of the LTE standard

This page was built for publication: Computing the probability of undetected error for shortened cyclic codes

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