New upper bounds on error exponents
From MaRDI portal
Publication:4701290
DOI10.1109/18.748991zbMath0947.94010OpenAlexW2162706887MaRDI QIDQ4701290
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
upper boundsKrawtchouk polynomialserror exponentsdistance distributionbinary symmetric channelsmaximum-likelihood decodingerror detecting
Bounds on codes (94B65) Error probability in coding theory (94B70) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items (11)
Estimates of the distance distribution of codes and designs ⋮ On the BSC reliability function: expanding the region where it is known exactly ⋮ A lower bound on the quantum capacity of channels with correlated errors ⋮ On lower bounds on the spectrum of a binary code ⋮ Code spectrum and the reliability function: binary symmetric channel ⋮ Sharpening of an upper bound for the reliability function of a binary symmetric channel ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ Binary \(B_2\)-sequences: a new upper bound ⋮ On the probability of undetected error for binary codes used for combined correction and detection ⋮ Linear codes with exponentially many light vectors ⋮ New upper bounds in the hypothesis testing problem with information constraints
This page was built for publication: New upper bounds on error exponents
