Sharpening of an upper bound for the reliability function of a binary symmetric channel

DOI10.1007/s11122-006-0001-6zbMath1104.94009OpenAlexW2073621259MaRDI QIDQ2432956

Marat V. Burnashev

Publication date: 26 October 2006

Published in: Problems of Information Transmission (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11122-006-0001-6

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Reliability and life testing (62N05) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Related Items (3)

On the BSC reliability function: expanding the region where it is known exactly ⋮ On lower bounds on the spectrum of a binary code ⋮ New upper bounds in the hypothesis testing problem with information constraints

Cites Work

• A lower bound on the probability of a union
• A new upper bound on the reliability function of the Gaussian channel
• Distance Distribution of Binary Codes and the Error Probability of Decoding
• Lower Bounds on the Error Probability of Block Codes Based on Improvements on de Caen's Inequality
• A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.)
• New upper bounds on error exponents
• A simple derivation of the coding theorem and some applications
• Bounds for the Probability of a Union, with Applications
• Lower bounds to error probability for coding on discrete memoryless channels. I
• On the relation between the code spectrum and the decoding error probability

This page was built for publication: Sharpening of an upper bound for the reliability function of a binary symmetric channel