A Simple Derivation of the Undetected Error Probabilties of Complementary Codes

DOI10.1109/TIT.2004.826672MaRDI QIDQ3546464zbMATH OpenOpenAlexFDO

Authors Khaled Abdel-Ghaffar

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Error probability in coding theory (94B70)

Recommendations

• Undetected error probabilities of codes for single-error correction and error detection
• The Probability of Undetected Error for Binary Constant-Weight Codes
• The Probability of Undetected Error for a Class of Asymmetric Error Detecting Codes
• On the undetected error probability for binary codes
• On the probability of undetected error for binary codes used for combined correction and detection
• Exact and Approximate Expressions for the Probability of Undetected Errors of Varshamov–Tenengol'ts Codes
• A Lower Bound on the Probability of Undetected Error for Binary Constant Weight Codes
• Bounds on the undetected error probabilities of linear codes for both error correction and detection
• A lower bound on the undetected error probability and strictly optimal codes
• On the Probability of Undetected Error for the Maximum Distance Separable Codes

Cited in

(3)

• On lower bounds on the spectrum of a binary code
• The Probability of Undetected Error for a Class of Asymmetric Error Detecting Codes
• On the undetected error probability for binary codes

This page was built for publication: A Simple Derivation of the Undetected Error Probabilties of Complementary Codes

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