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

DOI10.1109/18.623147zbMath0888.94027OpenAlexW2109730530MaRDI QIDQ4371890

Khaled A. S. 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

lower bounderror detectionblock codesoptimal codesdistance enumerators

Mathematics Subject Classification ID

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

Related Items (1)

Undetected error probability of \(q\)-ary constant weight codes

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