On the strong converse of the coding theorem for symmetric channels without memory
Author:
Lionel Weiss
Journal:
Quart. Appl. Math. 18 (1960), 209-214
MSC:
Primary 94.00
DOI:
https://doi.org/10.1090/qam/113744
MathSciNet review:
113744
Full-text PDF Free Access
References |
Similar Articles |
Additional Information
H. Cramér, “Sur un nouveau théorème-limite de la théorie des probabilitiés,” Colloque consacré à la théorie des probabilités, Hermann et Cie, Paris, 1938
- Amiel Feinstein, Foundations of information theory, McGraw-Hill Electrical and Electronic Engineering Series. McGraw-Hill Book Co., Inc., New York-Toronto-London, 1958. MR 0095087
- Claude E. Shannon, Certain results in coding theory for noisy channels, Information and Control 1 (1957), 6–25. MR 92707
- J. Wolfowitz, The coding of messages subject to chance errors, Illinois J. Math. 1 (1957), 591–606. MR 118565
J. Wolfowitz, “Strong converse of the coding theorem for semi-continuous channels,” to be published
H. Cramér, “Sur un nouveau théorème-limite de la théorie des probabilitiés,” Colloque consacré à la théorie des probabilités, Hermann et Cie, Paris, 1938
A. Feinstein, “Foundations of information theory,” McGraw-Hill, New York, 1958
C. E. Shannon, “Certain results in coding theory for noisy channels,” Information and Control 1, 6–25 (1957)
J. Wolfowitz, “The coding of messages subject to chance errors,” Illinois Journal of Mathematics 1, 591–606 (1957)
J. Wolfowitz, “Strong converse of the coding theorem for semi-continuous channels,” to be published
Similar Articles
Retrieve articles in Quarterly of Applied Mathematics
with MSC:
94.00
Retrieve articles in all journals
with MSC:
94.00
Additional Information
Article copyright:
© Copyright 1960
American Mathematical Society
