The art of signaling: fifty years of coding theory

IEEE Transactions on Information Theory

Volumn 44, Issue 6, 1998, Pages 2561-2595

  Calderbank, A R ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

Algebraic; Information and coding theory; Quantum and space time codes; Trellis

Indexed keywords

ALGEBRA; BLOCK CODES; CHANNEL CAPACITY; COMMUNICATION CHANNELS (INFORMATION THEORY); CRYPTOGRAPHY; GEOMETRY; INFORMATION THEORY; POLYNOMIALS; PROBABILITY; TRELLIS CODES;

CODING THEORY; GILBERT-VARSHAMOV BOUND; QUANTUM AND SPACE TIME CODES;

SIGNAL ENCODING;

EID: 0032183145     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.720549     Document Type: Article

References (234)

1. S. Alamouti, Space block coding: A simple transmitter diversity scheme for wireless communications, submitted to IEEE J. Select. Areas Commun., 1997.
2. E. F. Assmus Jr. and H. F. Mattson Jr., New 5-designs, J. Combin. Theory, vol. 6, pp. 122-151, 1969.
3. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, Optimal decoding of linear codes for minimizing symbol error rate, IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, 1974.
4. N. Balaban and J. Salz, Dual diversity combining and equalization in digital cellular mobile radio, IEEE Trans. Veh. Tech.nol, vol. 40, pp. 342-354, 1991.
5. A. Barg, At the dawn of the theory of codes, Math. Intelligencer, vol. 15, pp. 20-26, 1993.
6. L. E. Baum and T. Pétrie, Statistical inference for probabilistic functions of finite-state Markov chains, Ann. Math. Statist., vol. 37, pp. 1554-1563, 1966.
7. S. Benedetto and G. Montorsi, Unveiling turbo codes: Some results on parallel concatenated coding schemes, IEEE Trans. Inform. Theory, vol. 42, pp. 409-428, 1996.
8. C. H. Bennett, G. Brassard, S. Popescu, B. Schumacher, J. A. Smolin, and W. K. Wootters, Purification of noisy entanglement and faithful teleportation via noisy channels, Phys. Rev. Lett., vol. 76, pp. 722-725, 1996; also LANL eprint quant-ph/9511027.
9. C. H. Bennett, D. DiVincenzo, J. A. Smolin, and W. K. Wootters, Mixed state entanglement and quantum error correction, Phys. Rev. A, vol. 54, pp. 3824-3851, 1996; also LANL eprint quant-ph/9604024.
10. C. H. Bennett and P. W. Shor, Quantum information theory, this issue, pp. 2724-2742.
11. E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
12. C. Berrou, A. Glavieux, and P. Thitmajshima, Near Shannon limit error correcting coding and decoding: Turbo codes, in Proc. Int. Conf. Communications, 1993, pp. 1063-1070.
13. W. Betts, A. R. Calderbank, and R. Laroia, Performance of nonuniform constellations on the Gaussian channel, IEEE Trans. Inform. Theory, vol. 40, pp. 1633-1638, 1994
14. R. E. Blahut, Algebraic Methods for Signal Processing and Communications Codes. New York: Springer-Verlag, 1991.
15. I. F. Blake, Algebraic Coding Theory; History and Development. Stroudsburg, PA: Dowden, Hutchinson and Ross, 1973.
16. I. Blake, C. Heegard, T. Høholdt, and V. K. Wei, Algebraic-geometry codes, this issue, pp. 2596-2618.
17. W. G. Bliss, Circuitry for performing error correction calculations on baseband encoded data to eliminate error propagation, IBM Tech. Disci. Bull., vol. 23, pp. 4633-4634, 1981.
18. A. Blokhuis and A. R. Calderbank, Quasisymmetric designs and the smith normal form, Des., Codes Cryptogr., vol. 2, pp. 189-206, 1992.
19. A. Bonnecaze, A. R. Calderbank, and P. Sole, Quaternary quadratic residue codes and unimodular lattices, IEEE Trans. Inform. Theory, vol. 41, pp. 366-377, 1995.
20. R. C. Bose and D. M. Mesner, On linear associative algebras corresponding to association schemes of partially balanced designs, Ann. Math. Statist., vol. 30, pp. 21-38, 1959.
21. A. E. Brouwer, A. M. Cohen, and A. Neumaier, Distance Regular Graphs. Berlin, Germany: Springer-Verlag, 1989.
22. A. R. Calderbank, Multilevel codes and multistage decoding, IEEE Trans Commun., vol. 37, pp. 222-229, 1989.
23. 4-Kerdock codes, orthogonal spreads and extremal euclidean line sets, in Proc. London Math. Soc., vol. 75, pp. 436-480, 1997.
24. A. R. Calderbank and P. Delsarte, Extending the i-design concept, Trans. Amer. Math. Soc., vol. 338, pp. 941-962, 1993.
25. A. R. Calderbank, P. Delsarte, and N. J. A. Sloane, Strengthening of the Assmus-Mattson theorem, IEEE Trans. Inform. Theory, vol. 37, pp. 1261-1268, 1991.
26. A. R. Calderbank, G. D. Forney, Jr., and A. Vardy, Minimal tail-biting representations of the golay code and others, IEEE Trans. Inform. Theory, to be published.
27. A. R. Calderbank, R. Laroia, and S. W. McLaughlin, Partial response codes for electron trapping optical memories, IEEE Trans. Commun., vol. 46, pp. 1011-1019, 1998.
28. A. R. Calderbank, W.-C. W. Li, and B. Poonen, A 2-adic approach to the analysis of cyclic codes, IEEE Trans. Inform. Theory, vol. 43, pp. 977-986, 1997.
29. A. R. Calderbank, G. McGuire, P. V. Kumar, and T. Helleseth, Cyclic codes over Z4, locator polynomials and Newton's identities, IEEE Trans. Inform. Theory, vol. 43, pp. 217-226, 1996.
30. A. R. Calderbank and J. E. Mazo, Baseband line codes via spectral factorization, IEEE J. Select. Areas Commun., vol. 7, pp. 914-928, 1989.
31. A. R. Calderbank and L. H. Ozarow, Nonequiprobable signaling on the Gaussian channel, IEEE Trans. Inform. Theory, vol. 33, pp. 726-740, 1990.
32. A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, Quantum error correction and orthogonal geometry, Phys. Rev. Lett., vol. 78, pp. 405-409, 1997; also LANL eprint quant-ph/9605005.
33. A. R. Calderbank, E. M. Rains, P. W. Shor, and N. J. A. Sloane, Quantum error correction via codes over GF (4), IEEE Trans. Inform. Theory, vol. 44, pp. 1369-1387, July 1998.
34. A. R. Calderbank and N. Seshadri, Multilevel codes for unequal error protection, IEEE Trans. Inform. Theory, vol. 39, pp. 1234-1248, 1993.
35. A. R. Calderbank and P. W. Shor, Good quantum error-correcting codes exist, Phys. Rev. A, vol. 54, pp. 1098-1105, 1996; also LANL eprint quant-ph/9512032.
36. A. R. Calderbank and N. J. A. Sloane, New trellis codes based on lattices and cosets, IEEE Trans. Inform. Theory, vol. 33, pp. 177-195, 1987.
37. P. J. Cameron and J. J. Seidel, Quadratic forms over GF(2), Indag. Math., vol. 35, pp. 1-8, 1973.
38. P. Camion, Codes and association schemes, in Handbook of Coding Theory, R. A. Brualdi, W. C. Huffman, and V. Pless, Eds. Amsterdam, The Netherlands: Else vier, to be published.
39. H. Chen, On minimum Lee weights of Hensel lifts of some binary BCH codes, IEEE Trans. Inform. Theory, submitted for publication.
40. R. T. Chien, Cyclic decoding procedure for the Bose-Chaudhuri-Hocquengham codes, IEEE Trans. Inform. Theory, vol. IT-10, pp. 357-363, 1964.
41. O. M. Collins, The subtleties and intricacies of building a constraint length 15 convolutional decoder, IEEE Trans. Commun., vol. 40, pp. 1810-1819, 1992.
42. J. H. Conway and N. J. A. Sloane, A fast encoding method for lattice codes and quantizers, IEEE Trans. Inform. Theory, vol. IT-29, pp. 820-824, 1983.
43. Soft decoding techniques for codes and lattices including the Golay code and the Leech lattice, IEEE Trans. Inform. Theory, vol. IT-32, pp. 41-50, 1986
44. Sphere Packings, Lattices and Groups. New York: Springer-Verlag, 1988.
45. D. J. Costello, Jr., J. Hagenauer, H. Imai, and S. B. Wicker, Applications of error control coding, this issue, pp. 2531-2560.
46. T. M. Cover, Broadcast channels, IEEE Trans. Inform. Theory, vol. IT-18, pp. 2-14, 1972.
47. R. V. Cox, J. Hagenauer, N. Seshadri, and C.-E. Sundberg, Variable rate sub-band speech coding and matched convolutional channel coding for mobile radio channels, IEEE Trans. Signal Processing, vol. 39, pp. 1717-1731, 1991.
48. P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Res. Rep. Suppl, no. 10, 1973.
49. Four fundamental parameters of a code and their combinatorial significance, Inform. Contr., vol. 23, pp. 407-438, 1973.
50. Hahn polynomials, discrete harmonics and i-designs, SIAM J. Appl. Math., vol. 34, pp. 157-166, 1978.
51. Application and generalization of the Mac Williams transform in coding theory, in P roc. 15th Symp. Information Theory in the Benelux (Louvain-la-Neuve, Belgium, 1989), pp. 9-14.
52. P. Delsarte and J.-M. Goethals, Alternating bilinear forms over GF(g), J. Comb. Theory (A), vol. 19, pp. 26-50, 1975.
53. P. Delsarte, J.-M. Goethals, and J. J. Seidel, Bounds for systems of lines and Jacobi polynomials, Philips Res. Rep., vol. 30, pp. 91-105, 1975.
54. Spherical codes and designs, Geom. Dedicata, vol. 6, pp. 363-388, 1977.
55. P. Delsarte and V. I. Levenshtein, Association schemes and coding theory, this issue, pp. 2477-2504.
56. P. Delsarte and R. J. McEliece, Zeros of functions in finite abelian group algebras, Amer. J. Math., vol. 98, pp. 197-224, 1976.
57. P. Delsarte and J. J. Seidel, Fisher type inequalities for euclidean -designs, Lin. Alg. Appl., vols. 114/115, pp. 213-230, 1989.
58. M. R. de Prony, Essai experimentalle et analytique, J. École Polytech. Paris, vol. 1, pp. 24-76, 1795.
59. I. Duursma, Majority coset decoding, IEEE Trans. Inform. Theory, vol. 39, pp. 1067-1071, 1993.
60. I. Duursma and R. Kotier, Error-locating pairs for cyclic codes, IEEE Trans. Inform. Theory, vol. 40, pp. 1108-1121, 1994.
61. D. Ehrhard, Achieving the designed error capacity in decoding algebraic-geometric codes, IEEE Trans. Inform. Theory, vol. 39, pp. 743-751, 1993
62. A. Ekert and C. Macchiavello, Error correction in quantum communication, Phys. Rev. Lett., vol. 77, pp. 2585-2588, 1996; also LANL eprint quant-phi/9602022.
63. E. Eleftheriou and R. Cideciyan, On codes satisfying Mth order running digital sum constraints, IEEE Trans. Inform. Theory, vol. 37, pp. 1294-1313, 1991.
64. A. A. El Gamal and T. M. Cover, Achievable rates for multiple descriptions, IEEE Trans. Inform. Theory, vol. IT-28, pp. 851-857, 1982
65. W. H. R. Equitz and T. M. Cover, Successive refinement of information, IEEE Trans. Inform. Theory, vol. 37, pp. 269-275, 1991.
66. P. Erdös, C. Ko, and R. Rado, Intersection theorems for systems of finite sets, Quart. J. Math. Oxford, vol. 12, pp. 313-320, 1961.
67. J. Feigenbaum, The use of coding theory in computational complexity, in Different Aspects of Coding Theory, Proc. Symp. in Appl. Math., vol. 50. Providence, RI: Amer. Math. Soci., 1995, pp. 207-233.
68. A. Feldmann, A. C. Gilbert, and W. Willinger, Data networks as cascades: Investigating the multifractal nature of internet WAN traffic, to be published in Proc. ACM/SIGCOMM'98.
69. G.-L. Feng and T. R. N. Rao, Decoding of algebraic geometric codes up to the designed minimum distance, IEEE Trans. Inform. Theory, vol. 39, pp. 37-45, 1993.
70. G.-L. Feng and K. K. Tzeng, A new procedure for decoding cyclic and BCH codes up to the actual minimum distance, IEEE Trans. Inform. Theory, vol. 40, pp. 1364-1374, 1994.
71. R. A. Fisher, The theory of confounding in factorial experiments in relation to the theory of groups, Ann. Eugenics, vol. 11, pp. 341-353, 1942.
72. R. A. Fisher, A system of confounding for factors with more than two alternatives, giving completely orthogonal cubes and higher powers, Ann. Eugenics, vol. 12, pp. 2283-2290, 1945.
73. G. D. Forney, Jr., On decoding BCH codes, IEEE Trans. Inform. Theory, vol. IT-11, pp. 549-557, 1965
74. Concatenated Codes. Cambridge, MA: MIT Press, 1966.
75. Convolutional codes I: Algebraic structure, IEEE Trans. Inform. Theory, vol. IT-16, pp. 720-738, 1970; correction in vol. IT-17, p. 360, 1971.
76. Maximum likelihood sequence estimation in the presence of intersymbol interference, IEEE Trans. Inform. Theory, vol. IT-18, pp. 363-378, 1972
77. The Viterbi algorithm, Proc. IEEE, vol. 61, pp. 267-278, 1973.
78. Minimal bases of rational vector spaces wtih applications to multivariable linear systems, SIAM J. Contr., vol. 13, pp. 439-520, 1975
79. Coset codes-Part I: Introduction and geometrical classification, IEEE Trans. Inform. Theory, vol. 34, pp. 1123-1151, 1988.
80. Coset codes-Part II: Binary lattices and related codes, IEEE Trans. Inform. Theory, vol. 34, pp. 1152-1187, 1988.
81. Geometrically uniform codes, IEEE Trans. Inform. Theory, vol. 37, pp. 1241-1260, 1991.
82. Trellis shaping, IEEE Trans. Inform. Theory, vol. 38, pp. 281-300, 1992.
83. G. D. Forney, Jr., L. Brown, M. V. Eyuboglu, and J. L. Moran III, The V.34 high-speed modem standard, IEEE Commun. Mag., vol. 34, pp. 28-33, Dec. 1996.
84. G. D. Forney, Jr. and A. R. Calderbank, Coset codes for partial response channels; or coset codes with spectral nulls, IEEE Trans. Inform. Theory, vol. 35, pp. 925-943, 1989.
85. G. D. Forney, Jr. and M. Trott, The dynamics of group codes: State spaces, trellis diagrams and canonical encoders, IEEE Trans. Inform. Theory, vol. 39, pp. 1491-1513, 1993.
86. G. D. Forney, Jr. and G. Ungerboeck, Modulation and coding for linear Gaussian channels, this issue, pp. 2384-2415.
87. G. D. Forney, Jr. and A. Vardy, Generalized minimum distance decoding of euclidean-space codes and lattices, IEEE Trans. Inform. Theory, vol. 42, pp. 1992-2026, 1996.
88. G. J. Foschini, Jr. and M. J. Gans, On limits of wireless communication in a fading environment when using multiple antennas, Wireless Personal Commun., to be published.
89. P. Frankl, The Erdos-Ko-Rado theorem is true for n = ckt, in Combinatorics, Proc. 5th Hungarian Colloq. Combinatorics, Keszthely. Amsterdam, The Netherlands: North-Holland, 1976, pp. 365-375.
90. B. J. Frey and F. R. Kschischang, Probability propagation and iterative decoding, in Proc. 34th Allerton Conf. Communication, Control, and Computing, 1996, pp. 482-493.
91. R. G. Gallager, Low-density parity-check codes, IEEE Trans. Inform. Theory, vol. IT-8, pp. 21-28, 1962.
92. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge MA: MIT Press, 1963.
93. A. Garcia and H. Stichtenoth, A tower of Artin-Schreier extensions of function fields attaining the Drinfeld-Vlädut bound, Invent. Math., vol. 121, pp. 211-222, 1995.
94. A. V. Geramita and J. Seberry, Orthogonal designs, quadratic forms and Hadamard matrices, in Lecture Notes in Pure and Applied Mathematics, vol. 43. New York and Basel: Marcel Decker, 1979.
95. E. N. Gilbert, A comparison of signalling alphabets, Bell Syst. Tech. J.. vol. 31, pp. 504-522, 1952.
96. R. D. Gitlin, J. Salz, and J. H. Winters, The capacity of wireless communications systems can be substantially increased by the use of antenna diversity, IEEE J. Select. Areas Commun., to be published.
97. A. M. Gleason, Weight polynomials of self-dual codes and the MacWilliams identities, in Actes Congrès Int. de Math., vol. 3, pp. 211-215, 1970.
98. J.-M. Goethals, Two dual families of nonlinear binary codes, Electron. Lett., vol. 10, pp. 471-472, 1974.
99. Nonlinear codes defined by quadratic forms over GF(2), Inform. Contr., vol. 31, pp. 43-74, 1976.
100. J.-M. Goethals and J. J. Seidel, The football, Nieuw. Arch. Wiskunde, vol. 29, pp. 50-58, 1981.
101. J.-M. Goethals and H. C. A. van Tilborg, Uniformly packed codes, Philips Res. Rep., vol. 30, pp. 9-36, 1975.
102. M. J. E. Golay, Notes on digital coding, Proc. IEEE, vol. 37, p. 657, 1949.
103. V. D. Goppa, Codes on algebraic curves, Sov. Math.-Dokl., vol. 24, pp. 170-172, 1981.
104. Translation from Dokl. Akad. Nauk S.S.S.R., vol. 259, pp. 1289-1290, 1981.
105. D. C. Gorenstein and N. Zierler, A class of error correcting codes in pm symbols, SIAM J., vol. 9, pp. 207-214, 1971.
106. D. Gottesman, A class of quantum error-correcting codes saturating the quantum Hamming bound, Phys. Rev. A, vol. 54, pp. 1862-1868, 1996; also LANL eprint quant-ph/9604038
107. J. Hagenauer and P. Hoeher, A Viterbi algorithm with soft-decision out-puts and its applications, in IEEE Globecom'89, 1989, pp. 1680-1685.
108. J. Hagenauer, E. Offer, and L. Papke, Matching Viterbi decoders and Reed-Solomon decoders in concatenated systems, in Reed-Solomon Codes and Their Applications, S. B. Wicker and V. K. Bhargava, Eds. Piscataway, NJ: IEEE Press, 1994, pp. 242-271.
109. A. R. Hammons, Jr., P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Sole, The Z4-linearity of Kerdock, Preparata, Goethals and related codes, IEEE Trans. Inform. Theory, vol. 40, pp. 301-319, 1994.
110. R. H. Hardin and N. J. A. Sloane, Codes (spherical) and designs (experimental), in Different Aspects of Coding Theory, Proc. Symp. Applied Mathematics, vol. 50. Providence RI: Amer. Math. Soc., 1995, pp. 179-206.
111. T. Høholdt and R. Pellikaan, On the decoding of algebraic-geometric codes, IEEE Trans. Inform. Theory, vol. 41, pp. 1589-1614, 1995.
112. [Ill] A. S. Householder, Principles of Numerical Analysis. New York: McGraw-Hill, 1953.
113. H. Imai and S. Hirakawa, A new multi-level coding method using error correcting codes, IEEE Trans. Inform. Theory, vol. IT-23, pp. 371-377, 1977.
114. K. A. S. Immink, RS codes and the compact disk, in Reed-Solomon Codes and Their Applications, S. B. Wicker and V. K. Bhargava, Eds. Piscataway, NJ: IEEE Press, 1994, pp. 41-59.
115. A practical method for approaching the channel capacity of constrained channels, IEEE Trans. Inform. Theory, vol. 43, pp. 1389-1399, 1997.
116. K. A. S. Immink and G. Beenker, Binary transmission codes with higher order spectral nulls at zero frequency, IEEE Trans. Inform. Theory, vol. IT-33, pp. 452-454, 1987.
117. International Telecommunication Union, ITU-T Recommendation V.34, A modem operating at data signaling rates of up to 28,800 bits/s for use on the general switched telephone network and on leased point-to-point 2-wire telephone-type circuits, Sept. 1994.
118. J. Justesen, A class of constructive asymptotically good algebraic codes, IEEE Trans. Inform. Theory, vol. IT-18, pp. 652-656, 1972.
119. Information rates and power spectra of digital codes, IEEE Trans. Inform. Theory, vol. IT-28, pp. 457-472, 1982.
120. J. Justesen, K. J. Larsen, H. E. Jensen, A. Havemose, and T. Høholdt, Construction and decoding of a class of algebraic geometry codes, IEEE Trans. Inform. Theory, vol. 35, pp. 811-821, 1989.
121. D. Kahn, The Codebreakers, The Story of Secret Writing. New York: MacMillan, 1967.
122. R. Karabed and P. H. Siegel, Matched spectral null codes for partial response channels, IEEE Trans. Inform. Theory, vol. 37, pp. 818-855, 1991.
123. A. M. Kerdock, A class of low-rate nonlinear binary codes, Inform. Contr., vol. 20, pp. 182-187, 1972.
124. C. Kirfel and R. Pellikaan, The minimum distance of codes in an array coming from telescopic subgroups, IEEE Trans. Inform. Theory, vol. 41, pp. 1720-1731, 1995.
125. H. Kobayashi, Correlative level coding and maximum likelihood decoding, IEEE Trans. Inform. Theory, vol. IT-17, pp. 586-594, 1971.
126. H. Kobayashi and D. T. Tang, Applications of partial response channel coding to magnetic recording systems, IBM J. Res. Develop., vol. 14, pp. 368-375, 1970.
127. H. König, Isometric Embeddings of Euclidean Spaces into FiniteDimensional lp-Spaces (Banach Center Publications, vol. 34.). Warsaw, Poland: PWN, 1995, pp. 79-87.
128. V. Koshélev, Estimation of mean error for a discrete successive approximation scheme, Probl. Inform. Transm., vol. 17, pp. 20-33, 1981.
129. E. S. Lander, Symmetric Designs: An Algebraic Approach (London Math. Soc. Lecture Notes, vol. 74). London/New York: Cambridge Univ. Press, 1983.
130. R. Laroia, Coding for intersymbol interference channels-Combined coding and preceding, IEEE Trans. Inform. Theory, vol. 42, pp. 1053-1061, 1996.
131. R. Laroia, N. Farvardin, and S. Tretter, On optimal shaping of mul-tidimensional constellations, IEEE Trans. Inform. Theory, vol. 40, pp. 1044-1056, 1994.
132. J. Leech, Notes on sphere packings, Canadian J. Math., vol. 19, pp. 251-267, 1967.
133. J. Leech and N. J. A. Sloane, Sphere packings and error-correcting codes, Canadian J. Math., vol. 23, pp. 718-745, 1971.
134. W. E. Leland, M. S. Taqqu, W. Willinger, and D. V. Wilson, On the self-similar nature of ethernet traffic (extended version), IEEE/ACM Trans. Networking, vol. 2, pp. 1-15, 1994.
135. V. I. Levenshtein, On bounds for packings in n-dimensional euclidean space, Sov. Math.-Dokl, vol. 20, no. 2, pp. 417-421, 1979.
136. Bounds on the maximum cardinality of a code with bounded modulus of the inner product, Sov. Math.-Dokl., vol. 25, pp. 526-531, 1982.
137. Designs as maximum codes in polynomial metric spaces, Acta Applic. Math., vol. 29, pp. 1-82, 1992.
138. S. Lin and E. J. Weldon, Jr., Long BCH codes are bad, Inform. Contr., vol. 11, pp. 452-495, 1967.
139. J. H. van Lint, Nonexistence theorems for perfect error correcting codes, in Computers in Algebraic Number Theory, SIAM-AMS Proc., vol. IV, 1971.
140. Coding theory, in Springer Lecture Notes, vol. 201. Berlin-Heidelberg-New York: Springer, 1971.
141. J. H. van Lint and R. M. Wilson, On the minimum distance of cyclic codes, IEEE Trans. Inform. Theory, vol. IT-32, pp. 23-40, 1986.
142. S. P. Lloyd, Binary block coding, Bell Syst. Tech. J., vol. 36, pp. 517-535, 1957.
143. [ 142] H.-A. Loeliger, Averaging bounds for lattices and linear codes, IEEE Trans. Inform. Theory, vol. 43, pp. 1767-1773, 1997.
144. T. D. Lookabaugh and R. M. Gray, High-resolution quantization theory and the vector quantizer advantage, IEEE Trans. Inform. Theory, vol. 35, pp. 1020-1033, 1989.
145. L. Lovâsz, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, vol. IT-25, pp. 1-7, 1979.
146. D. J. C. MacKay and R. M. Neil, Near Shannon limit performance of low density parity check codes, Electron. Lett., vol. 32, pp. 1645-1646, 1996 (reprinted vol. 33, pp. 457-458, 1997).
147. F. J. Mac Williams, Combinatorial properties of elementary abelian groups, Ph.D. dissertation, Harvard Univ., Cambridge, MA, 1962.
148. A theorem on the distribution of weights in a systematic code, Bell Syst. Tech. J., vol. 42, pp. 79-94, 1963.
149. F. J. Mac Williams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North Holland, 1977.
150. F. J. Mac Williams, N. J. A. Sloane, and J. G. Thompson, Good self-dual codes exist, Discr. Math., vol. 3, pp. 153-162, 1972.
151. M. W. Marcellin and T. R. Fischer, Trellis-coded quantization of memoryless and Gauss-Markov sources, IEEE Trans. Commun., vol. 38, pp. 82-93, 1993.
152. B. Marcus, Symbolic dynamics and connections to coding theory automata theory and system theory, in Different Aspects of Coding Theory, Proc. Symp. Applied Mathematics, vol. 50. Providence, RI: Amer. Math. Soc., 1995, pp. 95-108.
153. B. H. Marcus, P. H. Siegel, and J. K. Wolf, Finite-state modulation codes for data storage, IEEE J. Select. Areas Commun., vol. 10, pp. 5-37, 1992.
154. J. L. Massey, Shift register synthesis and BCH decoding, IEEE Trans. Inform. Theory, vol. IT-15, pp. 122-127, 1969.
155. H. F. Mattson, Jr. and G. Solomon, A new treatment of Bose-Chaudhuri codes, SIAM J., vol. 9, pp. 654-669, 1961.
156. R. J. McEliece, Finite Fields for Computer Scientists and Engineers. Boston-Dordrecht-Lancaster: Kluwer, 1987.
157. R. J. McEliece, E. R. Rodemich, H. Rumsey, Jr., and L. R. Welch, New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities, IEEE Trans. Inform. Theory, vol. IT-23, pp. 157-166, 1977.
158. H. Miyakawa and H. Harashima, Capacity of channels with matched transmission technique for peak transmitting power limitation, in Nat. Conv. Rec. IECE Japan, 1969, pp. 1268-1264.
159. D. J. Muder, Minimal trellises for block codes, IEEE Trans. Inform. Theory, vol. 34, pp. 1049-1053, 1988.
160. A. Naguib, Adaptive antennas for CDMA wireless networks, Ph.D. dissertation, Stanford Univ., Stanford, CA, 1996.
161. A. F. Naguib and N. Seshadri, Combined interference cancellation and maximum likelihood decoding of space-time block codes, preprint, 1998.
162. K. Nakamura, A class of error correcting codes for DPSK channels, in Proc. Int. Conf. Communication, 1979, pp. 45.4.1-45.4.5.
163. Y. Nakamura, Y. Saito, and S. Aikawa, 256-QAM modem for multi-carrier 400 Mb/s digital radio, IEEE J. Select. Areas. Commun., vol. JSAC-5, pp. 329-335, 1987.
164. R. van Nobelen, Toward higher data rates for IS-36, in Proc. IEEE Vehicular Technology Conf., 1998, pp. 2403-2407.
165. A. W. Nordstrom and J. P. Robinson, An optimum nonlinear code, Inform. Contr., vol. 11, pp. 613-616, 1967.
166. A. M. Odlyzko and N. J. A. Sloane, New bounds on the number of spheres that can touch a unit sphere in n-dimensions, J. Combin. Theory, vol. (A)26, pp. 210-214, 1979.
167. L. H. Ozarow, On a source coding problem with two channels and three receivers, Bell Syst. Tech. J., vol. 59, pp. 1909-1921, 1980.
168. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan-Kaufmann, 1988.
169. J. B. H. Peek, Communications aspects of the compact disk digital audio system, IEEE Commun. Mag., vol. 23, pp. 7-15, Feb. 1985.
170. R. Pellikaan, On the decoding by error location and the number of dependent error positions, Discr. Math., vols. 106/107, pp. 369-381, 1992.
171. W. W. Peterson, Encoding and error correction procedures for the Bose-Chaudhuri codes, IEEE Trans. Inform. Theory, vol. 6, pp. 459-470, 1960.
172. S. C. Porter, Decoding codes arising from Goppa's construction on algebraic curves, Ph.D. dissertation, Yale Univ., New Haven, CT, 1988.
173. S. C. Porter, B.-Z. Shen, and R. Pellikaan, On decoding geometric Goppa codes using an extra place, IEEE Trans. Inform. Theory, vol. 38, pp. 1663-1676, 1992.
174. G. J. Pottie and D. P. Taylor, Multilevel codes based on partitioning, IEEE Trans. Inform. Theory, vol. 35, pp. 87-98, 1989.
175. F. P. Preparata, A class of optimum nonlinear double error correcting codes, Inform. Contr., vol. 13, pp. 378-400, 1968.
176. K. Ramchandran, A. Ortega, K. M. Uz, and M. Vetterli, Multiresolution broadcast for digital HDTV using joint source/channel coding, IEEE J. Select. Areas Commun., vol. 11, pp. 6-23, 1993.
177. C. R. Rao, Factorial experiments derivable from combinatorial arrangements of arrays, J. Roy. Statist. Soc., vol. 9, pp. 128-139, 1947.
178. D. K. Ray-Chaudhuri and N. M. Singhi, On existence of i-designs with large v and A, SIAM J. Discr. Math., vol. 1, pp. 98-104, 1988.
179. D. K. Ray-Chaudhuri and R. M. Wilson, On -designs, Osaka J. Math., vol. 12, pp. 737-744, 1975.
180. I. S. Reed and G. Solomon, Polynomial codes over certain finite fields, SIAM J., vol. 8, pp. 300-304, 1960.
181. S. Sakata, Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array, J. Symbolic Comput., vol. 5, pp. 321-337, 1988
182. S. Sakata, Extension of the Berlekamp-Massey algorithm to N dimen-sions, Inform. Comput., vol. 84, pp. 207-239, 1990.
183. S. Sakata, J. Justesen, Y. Madelung, H. E. Jensen, and T. H0holdt, Fast decoding of algebraic geometric codes up to the designed minimum distance, IEEE Trans. Inform. Theory, vol. 41, pp. 1672-1677, 1995.
184. N. V. Semakov, V. A. Zinoviev, and G. V. Zaitzev, Uniformly packed codes, Probl. Pered. Inform., vol. 7, pp. 38-50, 1971 (in Russian).
185. N. Seshadri and C.-E. Sundberg, Generalized Viterbi detection with convolutional codes, in IEEE Globecom'89, 1989, pp. 1534-1538.
186. N. Seshadri and J. H. Winters, Two signaling schemes for improving the error performance of frequency-division-duplex (FDD) transmission systems using transmitter antenna diversity, Int. J. Wireless Inform. Networks, vol. 1, pp. 49-60, 1994.
187. P. D. Seymour and T. Zaslavsky, Averaging sets, Adv. Math., vol. 52, pp. 213-240, 1984.
188. C. E. Shannon, A mathematical theory of communication I, II, Bell Syst. Tech. J., vol. 27, pp. 379-423; 623-656, 1948; Reprinted in C. E. Shannon and W. Weaver, A Mathematical Theory of Communication. Urbana, IL: Univ. Illinois Press, 1949.
189. The zero-error capacity of a noisy channel, IRE Trans. Inform. Theory, vol. IT-2, pp. 8-19, 1956.
190. M. A. Shokorollahi and H. Wassermann, Decoding algebraic-geometric codes beyond the error-correction bound, preprint, 1997.
191. P. W. Shor, Algorithms for quantum computation: Discrete logarithm and factoring, in Proc. 35th Annu. Symp. Foundations of Computer Science, 1994, pp. 124-134
192. Scheme for reducing deroherence in quantum computer memory, Phys. Rev. A., vol. 52, pp. 2493-2496, 1995.
193. P. W. Shor and R. Laflamme, Quantum analog of the Mac Williams identities in classical coding theory, Phys. Rev. Lett., vol. 78, pp. 1600-1602, 1997; also LANL eprint quant-ph/9610040.
194. V. M. Sidel'nikov, Extremal polynomials used in bounds of code volume, Probt. Pered. Inform., vol. 16, pp. 17-39, 1980 (in Russian).
195. English translation in Probl. Inform. Transm., vol. 16, pp. 174-186, 1980.
196. M. Sipser and D. A. Spielman, Expander codes, IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1722, 1996.
197. A. N. Skorobogatov and S. G. Vlädu;, On the decoding of algebraic geometric codes, IEEE Trans. Inform. Theory, vol. 36, pp. 1461-1463, 1990.
198. D. Slepian, A class of binary signaling alphabets, Bell Syst. Tech. J., vol. 35, pp. 203-234, 1956.
199. A note on two binary signaling alphabets, IRE Trans. Inform. Theory, vol. IT-2, pp. 84-86, 1956.
200. Some further theory of group codes, Bell Syst. Tech. J., vol. 39, pp. 1219-1252, 1960.
201. Group codes for the Gaussian channel, Bell Syst. Tech. ]., vol. 47, pp. 575-602, 1968.
202. D. Slepian and J. K. Wolf, Noiseless coding of correlated information, IEEE Trans. Inform. Theory, vol. IT-19, pp. 471-480, 1973.
203. N. J. A. Sloane, Error-correcting codes and invariant theory: New applications of a nineteenth century technique, Amer. Math. Monthly, vol. 84, pp. 82-107, 1977.
204. G. Solomon and H. C. A. van Tilborg, A connection between block and convolutional codes, SIAM J. Appl. Math., vol. 37, pp. 358-369, 1979.
205. A. M. Steane, Error correcting codes in quantum theory, Phys. Rev. Lett., vol. 77, pp. 793-797, 1996.
206. H. Stichtenoth, Algebraic geometric codes, in Different Aspects of Coding Theory, Proc. Symp. App. Math., vol. 50. Providence, RI: Amer. Math. Soc., 1995
207. M. Sudan, Decoding of Reed-Solomon codes beyond the error-correction bound, J. Complexity, vol. 13, pp. 180-193, 1997.
208. C.-E. Sundberg and N. Seshadri, Digital cellular systems for North America, in IEEE Globecom'90, 1990, pp. 533-537.
209. R. M. Tanner, A recursive approach to low complexity codes, IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, 1981.
210. V. Tarokh and I. F. Blake, Trellis complexity versus the coding gain of lattices, parts I and II, IEEE Trans. Inform. Theory, vol. 42, pp. 1796-1807 and 1808-1816, 1996.
211. V. Tarokh, N. Seshadri, and A. R. Calderbank, Space-time codes for high data rate wireless communication: Performance criterion and code construction, IEEE Trans. Inform. Theory, vol. 44, pp. 744-765, 1998.
212. E. Telatar, Capacity of multi-antenna Gaussian channels, AT&T Bell Labs. Internal Tech. Memo, June 1995.
213. M. A. Tsfasman, S. G. Vlädu;, and T. Zink, On Goppa codes which are better than the Varshamov-Gilbert bound, Math. Nach., vol. 109, pp. 21-28, 1982.
214. A. Tietâvâinen, On the nonexistence of perfect codes over finite fields, SIAM J. Appl. Math., vol. 24, pp. 88-96, 1973.
215. M. Tomlinson, New automatic equalizer employing modulo arith-metic, Electron. Lett., vol. 7, pp. 138-139, 1971.
216. V. A. Vaishampayan, Design of multiple description scalar quantizers, IEEE Trans. Inform. Theory, vol. 39, pp. 821-834, 1993.
217. G. Ungerboeck, Channel coding with multilevel/phase signals, IEEE Trans. Inform. Theory, vol. IT-28, pp. 55-67, 1982.
218. A. Vardy and Y. Be'ery, More efficient soft decoding of the Golay codes, IEEE Trans. Inform. Theory, vol. 37, pp. 667-672, 1991.
219. Maximum-likelihood decoding of the Leech lattice, IEEE Trans. Inform. Theory, vol. 39, pp. 1435-1444, 1993.
220. R. R. Varshamov, Estimate of the number of signals in error correcting codes, Dokl. Akad. Nauk. SSSR, vol. 117, pp. 739-741, 1957.
221. A. J. Viterbi, Error bounds for convolutional codes and an asymptot-ically optimal decoding algorithm, IEEE Trans. Inform. Theory, vol. IT-13, pp. 260-269, 1967.
222. U. Wachsmann and J. Huber, Power and bandwidth efficient digital communication using turbo codes in multilevel codes, Euro. Trans. Telecommun., vol. 6, pp. 557-567, 1995.
223. N. Wiberg, Codes and decoding on general graphs, Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
224. N. Wiberg, H.-A. Loeliger, and R. Kotier, Codes and iterative decoding on general graphs, Euro. Trans. Telecommun., vol. 6, pp. 513-525, 1995.
225. W. Willinger and V. Paxson, Where mathematics meets the internet, to be published in the Notices Amer. Math. Soc.
226. W. Willinger, M. S. Taqqu, and A. Erramilli, A bibliographical guide to self-similar traffic and performance modeling for modern high-speed networks, in Stochastic Networks: Theory and Applications, Royal Statistical Lecture Note Series, vol. 4, F. P. Kelly, S. Zachary, and I. Ziedins, Eds. Oxford, U.K.: Clarendon Press, 1996, pp. 339-366.
227. R. M. Wilson, The exact bound in the Erdos-Ko-Rado theorem, Combinatorica, vol. 4, pp. 247-257, 1984.
228. A. Wittneben, Base station modulation diversity for digital SIMULCAST, in Proc. IEEE Vehicular Technology Conf., 1993, pp. 505-511.
229. J. K. Wolf, Decoding of Bose-Chaudhuri-Hocquenghem codes and Prony's method for curve fitting, IEEE Trans. Inform. Theory, vol. IT-3, p. 608, 1967.
230. J. A. Wood, Extension theorems for linear codes over finite rings, preprint 1997.
231. K. Yang and P. V. Kumar, On the true minimum distance of hermitian codes, in Coding Theory and Algebraic Geometry (Lecture Notes in Mathematics, vol. 1518). Berlin, Germany: Springer, 1992, pp. 99-107.
232. V. A. Zinoviev, Generalized cascade codes, Probl. Pered. Inform., vol. 12, pp. 2-9, 1976 (in Russian).
233. V. A. Zinoviev and V. K. Leontiev, The nonexistence of perfect codes over Galois fields, Probl. Contr. Inform. Theory, vol. 2, pp. 123-132, 1973.
234. V. V. Zyablov and M. S. Pinsker, Estimates of the error-correction complexity of Gallager's low density codes, Probl. Inform. Transm., vol. 11, pp. 18-28, 1976.