On computing undetected error probabilities on the Gilbert channel

DOI10.1109/26.481214MaRDI QIDQ2726167zbMATH OpenOpenAlexFDO

Authors Brenden Wong, Cyril Leung

Publication date 7 February 2002

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

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

zbMATH Keywords

approximate code evaluationcyclic redundancy codesGilbert channelprobability of undetected error

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• On the undetected error probability of linear block codes on channels with memory
• Computing the probability of undetected error for shortened cyclic codes
• Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts Codes
• Undetected error probabilities of codes for single-error correction and error detection
• Concerning a bound on undetected error probability (Corresp.)

Cited in

(4)

• Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts Codes
• Computing the probability of undetected error for shortened cyclic codes
• Evaluation of the performance of error-correcting codes on a Gilbert channel
• On the undetected error probability of linear block codes on channels with memory

This page was built for publication: On computing undetected error probabilities on the Gilbert channel

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