On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory

DOI10.1007/3-540-45325-3_2zbMATH Open0999.94572OpenAlexW1848721013MaRDI QIDQ4550249FDOQ4550249

Authors: Christoph Lange, Andreas Ahrens 

Publication date: 2 December 2002

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45325-3_2

Recommendations

• Computing the probability of undetected error for shortened cyclic codes
• On the monotonic property of the probability of undetected error for a shortened code
• Error detection capability of shortened Hamming codes and their dual codes.
• On the undetected error probability of linear block codes on channels with memory
• Concerning a bound on undetected error probability (Corresp.)

zbMATH Keywords

channels with memoryprobability of undetected errorsshortened Hamming codes

Mathematics Subject Classification ID

Cyclic codes (94B15) Channel models (including quantum) in information and communication theory (94A40) Error probability in coding theory (94B70)

Cited In (2)

• Computing the probability of undetected error for shortened cyclic codes
• Error detection capability of shortened Hamming codes and their dual codes.

This page was built for publication: On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory

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