On the BSC reliability function: expanding the region where it is known exactly
From MaRDI portal
Publication:327296
DOI10.1134/S0032946015040018zbMATH Open1396.94111MaRDI QIDQ327296FDOQ327296
Authors: M. V. Burnashev
Publication date: 19 October 2016
Published in: Problems of Information Transmission (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 4077111
- Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
- On the reliability function for a BSC with noisy feedback
- A note on the Poor-Verdu upper bound for the channel reliability function
- scientific article; zbMATH DE number 3242951
Coding theorems (Shannon theory) (94A24) Rate-distortion theory in information and communication theory (94A34)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Code spectrum and the reliability function: binary symmetric channel
- Addendum to ``Code spectrum and the reliability function: binary symmetric channel
- 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
- Straight-line bound for the undetected error exponent
Cited In (2)
This page was built for publication: On the BSC reliability function: expanding the region where it is known exactly
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q327296)