A lower bound on the undetected error probability and strictly optimal codes

DOI10.1109/18.623147MaRDI QIDQ4371890zbMATH OpenOpenAlexFDO

Authors Khaled Abdel-Ghaffar

Publication date 29 May 1998

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

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

zbMATH Keywords

block codesdistance enumeratorserror detectionlower boundoptimal codes

Mathematics Subject Classification ID

Other types of codes (94B60) Bounds on codes (94B65) Error probability in coding theory (94B70)

Recommendations

• On the undetected error probability for binary codes
• Optimal codes for error detection
• Undetected error probabilities of codes for single-error correction and error detection

Cited in

(5)

• Undetected error probability of \(q\)-ary constant weight codes
• scientific article; zbMATH DE number 6694244 (Why is no real title available?)
• Optimal codes for minimax criterion on error detection
• A Simple Derivation of the Undetected Error Probabilties of Complementary Codes
• Bounds on the worst case probability of undetected error

This page was built for publication: A lower bound on the undetected error probability and strictly optimal codes

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