Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Bell (1969)
Information Theory and Reliable CommunicationElectronics and Power, 15
C. Shannon, R. Gallager, E. Berlekamp (1967)
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. IIInf. Control., 10
N. Sloane, A. Wyner (1993)
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. I
P. Elias (1957)
List decoding for noisy channels
(1967)
Combinatorial Theory, Waltham: Blaisdell
V. Blinovsky (1997)
Asymptotic Combinatorial Coding Theory
M. Hall (1967)
Combinatorial Theory
We prove that the expurgation bound on the error probability exponent for list-of-L decoding is tight at zero rate.
Problems of Information Transmission – Springer Journals
Published: Oct 9, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.