On Cading and Information Theory
Aaron D. Wyner · SIAM Review · 1969
Previous article Next article On Cading and Information TheoryA. D. WynerA. D. Wynerhttps://doi.org/10.1137/1011059PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] C. E. Shannon, A mathematical theory of communication, Bell System Tech. J., 27 (1948), 379–423, 623–656, Reprinted in C. E. Shannon and W. Weaver, The Mathematical Theory of Communication, University of Illinois Press, Urbana, 1949 MR0026286 (10,133e) CrossrefGoogle Scholar[2] R. G. Gallager, Information Theory and Reliable Communication, John Wiley, New York, 1968 0198.52201 Google Scholar[3] J. Wolfowitz, Coding theorems of information theory, Second edition. Ergebnisse der Mathematik und ihrer Grenzgebiete, Neue Folge, Band 31, Springer-Verlag, Berlin, 1964x+156 MR0176851 (31:1123) 0132.39704 CrossrefGoogle Scholar[4] Robert Ash, Information theory, Interscience Tracts in Pure and Applied Mathematics, No. 19, Interscience Publishers John Wiley & Sons, New York-London-Sydney, 1965xi+339 MR0229475 (37:5049) 0141.34904 Google Scholar[5] Norman Abramson, Informantion theory and coding, McGraw-Hill Book Co., New York, 1963xvi+201 MR0189890 (32:7308) Google Scholar[6] S. Kotz, Recent results in information theory, Methuen, london, 1966 0163.40702 Google Scholar[7] Robert G. Gallager, A simple derivation of the coding theorem and some applications, IEEE Trans. Information Theory, IT-11 (1965), 3–18 10.1109/TIT.1965.1053730 MR0186491 (32:3951) 0137.13502 CrossrefISIGoogle Scholar[8] C. E. Shannon, , R. G. Gallager and , E. R. Berlekamp, Lower bounds to error probability for coding on discrete memoryless channels. I, Information and Control, 10 (1967), 65–103 10.1016/S0019-9958(67)90052-6 MR0210513 (35:1405) 0245.94007 CrossrefGoogle Scholar[9] C. E. Shannon, , R. G. Gallager and , E. R. Berlekamp, Lower bounds to error probability for coding on discrete memoryless channels. II, Information and Control, 10 (1967), 522–552 10.1016/S0019-9958(67)91200-4 MR0216899 (35:7728) 0245.94007 CrossrefGoogle Scholar[10] William Feller, An Introduction to Probability Theory and Its Applications. Vol. I, John Wiley & Sons Inc., New York, N.Y., 1950xii+419 MR0038583 (12,424a) 0039.13201 Google Scholar[11] R. W. Hamming, Error detecting and error correcting codes, Bell System Tech. J., 29 (1950), 147–160 MR0035935 (12,35c) CrossrefISIGoogle Scholar[12] W. Wesley Peterson, Error-correcting codes, The M.I.T. Press, Cambridge, Mass., 1961x+285 MR0121260 (22:12003) 0105.32802 Google Scholar[13] Elwyn R. Berlekamp, Algebraic coding theory, McGraw-Hill Book Co., New York, 1968xiv+466 MR0238597 (38:6873) 0988.94521 Google Scholar[14] E. N. Gilbert, A comparison of signaling alphabets, Bell System Tech. J., 31 (1952), 504–522 CrossrefISIGoogle Scholar[15] M. Plotkin, Binary codes with specified minimum distance, IEEE Trans. Information Theory, IT-6 (1960), 445–450 10.1109/TIT.1960.1057584 CrossrefISIGoogle Scholar[16] P. Elias, Unpublished work. Elias' result is given in [8, Theorem 7] Google Scholar[17] A. D. Wyner, Capabilities of bounded discrepancy decoding, Bell Systems Tech. J., 44 (1965), 1061–1122 MR0180417 (31:4652) CrossrefISIGoogle Scholar[18] C. E. Shannon, Communication in the presence of noise, Proc. IRE, 37 (1959), 10–21 CrossrefISIGoogle Scholar[19] Claude E. Shannon, Probability of error for optimal codes in a Gaussian channel, Bell System Tech. J., 38 (1959), 611–656 MR0103137 (21:1920) CrossrefISIGoogle Scholar[20] H. J. Landau and , David Slepian, On the optimality of the regular simplex code, Bell System Tech. J., 45 (1966), 1247–1272 MR0219341 (36:2424) 0143.41503 CrossrefISIGoogle Scholar[21] A. H. Nuttal, Error probabilities for equicorrelated M-ary signals under phase-coherent and phase-incoherent reception, IEEE Trans. Information Theory, IT-8 (1962), 305–314 10.1109/TIT.1962.1057730 0109.11103 CrossrefISIGoogle Scholar[22] C. E. Weber, New solutions to the signal design problem for coherent channels, IEEE Trans. Information Theory, IT-12 (1966), 161–167 10.1109/TIT.1966.1053877 CrossrefISIGoogle Scholar[23] R. A. Rankin, The closest packing of spherical caps in n dimensions, Proc. Glasgow Math. Assoc., 2 (1955), 139–144 MR0074013 (17,523c) 0065.15601 CrossrefGoogle Scholar[24] A. D. Wyner, Capacity of the band-limited Gaussian channel, Bell System Tech. J., 25 (1966), 359–395 0161.38806 CrossrefGoogle Scholar[25] Claude E. Shannon, Certain results in coding theory for noisy channels, Information and Control, 1 (1957), 6–25 10.1016/S0019-9958(57)90039-6 MR0092707 (19,1148d) 0089.33902 CrossrefGoogle Scholar[26] R. L. Dobrusin, A general formulation of the fundamental theorem of Shannon in the theory of information, Uspehi Mat. Nauk, 14 (1959), 3–104, Reprinted in Amer. Math. Soc. Transl. (2), 33 (1963), pp. 323–438 MR0107574 (21:6299) Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails A Minimax Optimization Approach to the Spherical Codes Problem2018 IEEE International WIE Conference on Electrical and Computer Engineering (WIECON-ECE) | 1 Dec 2018 Cross Ref Information Theory and Coding TheoryWiley StatsRef: Statistics Reference Online | 17 November 2014 Cross Ref The Forties and FiftiesRational Number Theory in the 20th Century | 1 Jan 2012 Cross Ref Information Theory and Coding TheoryEncyclopedia of Statistical Sciences | 15 August 2006 Cross Ref Shannon theory: perspective, trends, and applications special issue dedicated to aaron d. wynerIEEE Transactions on Information Theory, Vol. 48, No. 6 | 1 Jun 2002 Cross Ref The Role of Modern Algebra in ComputingSelected Papers on Algebra and Topology by Garrett Birkhoff | 1 Jan 1987 Cross Ref Theta series and magic numbers for close‐packed spherical clustersThe Journal of Chemical Physics, Vol. 83, No. 12 | 15 Dec 1985 Cross Ref Upper Bounds on the Minimum Distance of Trellis CodesBell System Technical Journal, Vol. 62, No. 8 | 29 July 2013 Cross Ref Tables of sphere packings and spherical codesIEEE Transactions on Information Theory, Vol. 27, No. 3 | 1 May 1981 Cross Ref Significance arithmetic: the probability of carryingComputers & Mathematics with Applications, Vol. 3, No. 1 | 1 Jan 1977 Cross Ref BibliographyThe Theory of Error-Correcting Codes | 1 Jan 1977 Cross Ref Optimum permutation modulation codes and their asymptotic performance (Corresp.)IEEE Transactions on Information Theory, Vol. 22, No. 6 | 1 Nov 1976 Cross Ref Linear CodesA Short Course on Error Correcting Codes | 1 Jan 1975 Cross Ref Sphere-packing in the Hamming metricBulletin of the American Mathematical Society, Vol. 75, No. 1 | 1 Jan 1969 Cross Ref Volume 11, Issue 3| 1969SIAM Review307-427 History Submitted:28 March 1968Published online:02 August 2006 InformationCopyright © 1969 © Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1011059Article page range:pp. 317-346ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics