Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Burnashev (2007)
Code spectrum and the reliability function: Gaussian channelProblems of Information Transmission, 43
M.V. Burnashev (2006)
Code Spectrum and the Reliability Function: Binary Symmetric ChannelProbl. Peredachi Inf., 42
M.V. Burnashev (2005)
Sharpening of an Upper Bound for the Reliability Function of a Binary Symmetric ChannelProbl. Peredachi Inf., 41
M. Burnashev (2007)
Supplement to: Code Spectrum and Reliability Function: Binary Symmetric ChannelArXiv, abs/cs/0701182
M. Burnashev (2005)
Sharpening of an Upper Bound for the Reliability Function of a Binary Symmetric ChannelProblems of Information Transmission, 41
A much simpler proof of Theorem 1 from [1] is presented; we use the notation and enumeration of formulas of [1]. The text below replaces the subsection General Case in [1, Section 4, p. 271].
Problems of Information Transmission – Springer Journals
Published: Apr 20, 2007
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.