On the BSC reliability function: expanding the region where it is known exactly

DOI10.1134/S0032946015040018zbMath1396.94111MaRDI QIDQ327296

Marat V. Burnashev

Publication date: 19 October 2016

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

zbMATH Keywords

binary symmetric channel (BSC)

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Rate-distortion theory in information and communication theory (94A34)

Related Items (2)

On lower bounds on the spectrum of a binary code ⋮ New upper bounds in the hypothesis testing problem with information constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Code spectrum and the reliability function: binary symmetric channel
• Addendum to ``Code spectrum and the reliability function: binary symmetric channel
• Straight-line bound for the undetected error exponent
• Sharpening of an upper bound for the reliability function of a binary symmetric channel
• Distance Distribution of Binary Codes and the Error Probability of Decoding
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• New upper bounds on error exponents
• A simple derivation of the coding theorem and some 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: On the BSC reliability function: expanding the region where it is known exactly