Bounds on the worst case probability of undetected error

DOI10.1109/18.370096MaRDI QIDQ4840897zbMATH OpenOpenAlexFDO

Authors Torleiv Kløve

Publication date 1 August 1995

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

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

zbMATH Keywords

boundslinear codesundetected erroraverage worst-case probability

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Bounds on codes (94B65) Error probability in coding theory (94B70)

Recommendations

• Concerning a bound on undetected error probability (Corresp.)
• Upper bounds on the probability of nondetected error
• On some upper bounds for the probability of error
• On the undetected error probability for binary codes
• A lower bound on the undetected error probability and strictly optimal codes
• Undetected error probabilities of codes for single-error correction and error detection
• On the probability of undetected error for binary codes used for combined correction and detection
• The probability of undetected error can have several local maxima
• Straight-line bound for the undetected error exponent

Cited in

(5)

• The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
• Error probability bounds for nuclear detection: improving accuracy through controlled mobility
• On some properties of the NML estimator for Bernoulli strings
• Straight-line bound for the undetected error exponent
• Uniform asymptotics of some Abel sums arising in coding theory

This page was built for publication: Bounds on the worst case probability of undetected error

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