Sharpening of an upper bound for the reliability function of a binary symmetric channel
DOI10.1007/S11122-006-0001-6zbMATH Open1104.94009OpenAlexW2073621259MaRDI QIDQ2432956FDOQ2432956
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
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
- Bounds for the Probability of a Union, with Applications
- A lower bound on the probability of a union
- Lower Bounds on the Error Probability of Block Codes Based on Improvements on de Caen's Inequality
- 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
- A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel
- An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.)
- A new upper bound on the reliability function of the Gaussian channel
Cited In (7)
- On lower bounds on the spectrum of a binary code
- Title not available (Why is that?)
- Reliability function of a binary symmetrical channel with feedback
- Improved Upper Bounds on the Reliability Function of the Gaussian Channel
- On the BSC reliability function: expanding the region where it is known exactly
- Addendum to ``Code spectrum and the reliability function: binary symmetric channel
- New upper bounds in the hypothesis testing problem with information constraints
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)
