On the BSC reliability function: expanding the region where it is known exactly
From MaRDI portal
(Redirected from Publication:327296)
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
Cites work
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A simple derivation of the coding theorem and some applications
- Addendum to ``Code spectrum and the reliability function: binary symmetric channel
- Code spectrum and the reliability function: binary symmetric channel
- Distance Distribution of Binary Codes and the Error Probability of Decoding
- 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
- Sharpening of an upper bound for the reliability function of a binary symmetric channel
- 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)
