Access the full text.
Sign up today, get DeepDyve free for 14 days.
V.I. Levenstein (1989)
On the Straight-Line Bound for the Undetected Error ExponentProbl. Peredachi Inf., 25
R. McEliece, J. Omura (1977)
An improved upper bound on the block coding error exponent for binary-input discrete memoryless channels (Corresp.)IEEE Trans. Inf. Theory, 23
M. Burnashev (1984)
A new lower bound for the a-mean error of parameter transmission over the white Gaussian channelIEEE Trans. Inf. Theory, 30
A. Cohen, N. Merhav (2004)
Lower bounds on the error probability of block codes based on improvements on de Caen's inequalityIEEE Transactions on Information Theory, 50
D. Caen (1997)
A lower bound on the probability of a unionDiscret. Math., 169
P. Elias (1955)
Coding for Noisy ChannelsIRE Conv. Rec., 4
A. Barg, A. Mcgregor (2004)
Distance distribution of binary codes and the error probability of decodingIEEE Transactions on Information Theory, 51
A. Ashikhmin, A. Barg, S. Litsyn (2000)
A new upper bound on the reliability function of the Gaussian channelProceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253)
R. McEliece, E. Rodemich, H. Rumsey, L. Welch (1977)
New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalitiesIEEE Trans. Inf. Theory, 23
M.V. Burnashev (2000)
On the Relation between the Code Spectrum and the Decoding Error ProbabilityProbl. Peredachi Inf., 36
E. Kounias (1968)
Bounds for the Probability of a Union, with ApplicationsAnnals of Mathematical Statistics, 39
M.V. Burnashev (1985)
On Minimum Attainable Mean-Square Error in Transmission of a Parameter over a Channel with White Gaussian NoiseProbl. Peredachi Inf., 21
A. Ashikhmin, A. Barg, S. Litsyn (2000)
A New Upper Bound on the Reliability Function of the Gaussian ChannelIEEE Trans. Inform. Theory, 46
C. Shannon, R. Gallager, E. Berlekamp (1967)
Lower Bounds to Error Probability for Coding on Discrete Memoryless Channels. IIInf. Control., 10
R. Gallager (1965)
A simple derivation of the coding theorem and some applicationsIEEE Trans. Inf. Theory, 11
S. Litsyn (1999)
New Upper Bounds on Error ExponentsIEEE Trans. Inf. Theory, 45
S. Litsyn (1999)
New Bounds on Error ExponentsIEEE Trans. Inform. Theory, 45
M.V. Burnashev (1977)
Limits of Attainable Accuracy for Transmission of a Parameter over a White Gaussian ChannelProbl. Peredachi Inf., 13
An upper bound for the reliability function of a binary symmetric channel is improved.
Problems of Information Transmission – Springer Journals
Published: Jan 23, 2006
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.