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

DOI10.1007/S11122-006-0001-6MaRDI QIDQ2432956zbMATH OpenOpenAlexFDO

Authors M. 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) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cites work

• A lower bound on the probability of a union
• A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel
• A new upper bound on the reliability function of the Gaussian channel
• A simple derivation of the coding theorem and some applications
• An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.)
• Bounds for the Probability of a Union, with Applications
• 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
• Lower bounds to error probability for coding on discrete memoryless channels. I
• New upper bounds on error exponents
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On the relation between the code spectrum and the decoding error probability

Cited in

(7)

• Reliability function of a binary symmetrical channel with feedback
• New upper bounds in the hypothesis testing problem with information constraints
• Improved Upper Bounds on the Reliability Function of the Gaussian Channel
• Addendum to ``Code spectrum and the reliability function: binary symmetric channel
• scientific article; zbMATH DE number 4077111 (Why is no real title available?)
• On the BSC reliability function: expanding the region where it is known exactly
• On lower bounds on the spectrum of a binary code

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

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