New upper bounds on error exponents

DOI10.1109/18.748991MaRDI QIDQ4701290zbMATH OpenOpenAlexFDO

Authors Simon Litsyn

Publication date 21 November 1999

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

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

zbMATH Keywords

binary symmetric channelsdistance distributionerror detectingerror exponentsKrawtchouk polynomialsmaximum-likelihood decodingupper bounds

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40) Bounds on codes (94B65) Error probability in coding theory (94B70)

Recommendations

• Error bounds revisited
• On some upper bounds for the probability of error
• scientific article; zbMATH DE number 3410920
• Extremes of Error Exponents
• On the complexity of computing error bounds
• A new notion of error bounds: necessary and sufficient conditions
• Straight-line bound for the undetected error exponent
• New uniform parametric error bounds
• Theory of Cryptography
• Efficient and accurate computation of upper bounds of approximation errors

Cited in

(18)

• Coding theorem for a generalized maximum likelihood decoding scheme
• New uniform parametric error bounds
• Upper bounds on the probability of nondetected error
• On lower bounds on the spectrum of a binary code
• Improved upper bounds for parent-identifying set systems and separable codes
• Sharpening of an upper bound for the reliability function of a binary symmetric channel
• On the probability of undetected error for binary codes used for combined correction and detection
• On the BSC reliability function: expanding the region where it is known exactly
• On the Error Exponents of Improved Tangential Sphere Bounds
• Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators
• Upper bounds on sequential decoding performance parameters
• Code spectrum and the reliability function: binary symmetric channel
• Estimates of the distance distribution of codes and designs
• A lower bound on the quantum capacity of channels with correlated errors
• Binary \(B_2\)-sequences: a new upper bound
• Linear codes with exponentially many light vectors
• New upper bounds in the hypothesis testing problem with information constraints
• Straight-line bound for the undetected error exponent

This page was built for publication: New upper bounds on error exponents

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