On the monotonic property of the probability of undetected error for a shortened code

DOI10.1109/18.133258zbMATH Open0735.94007OpenAlexW2065819958MaRDI QIDQ3980934FDOQ3980934

Authors: Toru Fujiwara, Tadao Kasami, Shouping Feng 

Publication date: 26 June 1992

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

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

Recommendations

• Sufficient conditions for monotonicity of the undetected error probability for large channel error probabilities
• Undetected error probabilities of codes for single-error correction and error detection
• Error detection capability of shortened Hamming codes and their dual codes.
• Computing the probability of undetected error for shortened cyclic codes

zbMATH Keywords

trinomialcode lengthsymbol error probabilitymaximum distance separable codebit-error rateprobability of undetected errorbinary cyclic Hamming codeq-ary symmetric channelshortened code of a linear code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited In (2)

• On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory
• Error detection capability of shortened Hamming codes and their dual codes.

This page was built for publication: On the monotonic property of the probability of undetected error for a shortened code

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