Error Correction Coding: Mathematical Methods and Algorithms

Error Correction Coding: Mathematical Methods and Algorithms

Volumn , Issue , 2005, Pages 1-756

  Moon, Todd K ^a  

^a UTAH STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84889424136     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/0471739219     Document Type: Book

References (388)

1. D. Agarwal and A. Vardy, "The Turbo Decoding Algorithm and its Phase Trajectories," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 699-722, Feb. 2001.
2. S. M. Aji and R. J. McEliece, "The Generalized Distributive Law," IEEE Trans. Info. Theory, vol. 46, no. 2, pp. 325-343, Mar. 2000.
3. S. Alamouti, "A Simple Transmit Diversity Technique for Wireless Communications," IEEE J. on Selected Areas in Comm., vol. 16, no. 8, pp. 1451-1458, Oct. 1998.
4. J. Anderson and M. Hladik, "Tailbiting MAP Decoders," IEEE Journal on Selected Areas in Communications, vol. 16, no. 2, pp. 297-302, Feb. 1998.
5. J. B. Anderson and A. Svensson, Coded Modulation Systems. New York: Kluwer Academic/Plenum, 2003.
6. K. Andrews, C. Heegard, and D. Kozen, "A Theory of Interleavers," Cornell University Department of Computer Science," TR97-1634, June 1997.
7. J. B. Anderson and A. Svensson, "Interleaver Design Methods for Turbo Codes," in Proc. 1998 Intl. Symposium on Info. Theory, 1998, p. 420.
8. S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan, "Reconstructing Algebraic Functions from Mixed Data," in Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, pp. 503-512.
9. D. Augot and L. Pecquet, "A Hensel Lifting to Replace Factorization In List-Decoding of Algebraic-Geometric and Reed-Solomon Codes," IEEE Trans. Information Theory, vol. 46, pp. 2605-2614, Nov. 2000.
10. L. R. Bahl, C. D. Cullum, W. D. Frazer, and F. Jelinek, "An efficient algorithm for computing free distance," IEEE Trans. Info. Theory, pp. 437-139, May 1972.
11. L. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal Decoding of Linear Codes for Minimizing Symbol Error Rate," IEEE Trans. Info. Theory, vol. 20, pp. 284-287, Mar. 1974.
12. A. Barbulescu and S. Pietrobon, "Interleaver Design for Turbo Codes," Electron. Lett., vol. 30, no. 25, p. 2107, 1994.
13. S. Ar, R. Lipton, R. Rubinfeld, and M. Sudan, "Terminating the Trellis of Turbo-Codes in the Same State," Electron. Lett., vol. 31, no. 1, pp. 22-23, 1995.
14. J. R. Barry, "The BCJR Algorithm for Oprirmal Equalization," http://users.ece.gatech.edu/~barry/6603/handouts/Notes on the BCJR Algorithm.
15. J. R. Barry, E. A. Lee, and D. G. Messerschmitt, Digital Communication, 3rd ed. Boston: Kluwer Academic, 2004.
16. G. Bartail and J. Fang, "D'ecodage pondere optimal des codes lineakes en blocs," Annates des Tde'communications, vol. 41, pp. 580-604, Nov. 1986.
17. R. E. Bellman and S. E. Dreyfus, Applied Dynamic Programming. Princeton, NJ: Princeton University Press, 1962.
18. S. Benedetto, R. Garello, M. Mondin, and M. Trott, "Rotational Invariance of Trellis Codes Part II: Group Codes and Decoders," IEEE Trans. Information Theory, vol. 42, pp. 766-778, May 1996.
19. S. Benedetto and G. Montorsi, "Average Performance of Parallel Concatenated Block Codes," Electron. Lett., vol. 31, no. 3, pp. 156-158,1995.
20. S. Benedetto and G. Montorsi, "Design of Parallel Concatenated Convolutional Codes," IEEE Trans. Comm., vol. 44, no. 5, pp. 591-600,1996.
21. S. Benedetto and G. Montorsi, "Unveiling Turbo Codes: Some Results on Parallel Concatenated Coding Schemes," IEEE Trans. Info. Theory, vol. 42, no. 2, pp. 409-428, Mar. 1996.
22. E. Berlekamp, "Nonbinary BCH decoding," in Proc. Int'l. Symp. on Info. Th., San Remo, Italy, 1967.
23. E. Berlekamp, "Bounded Distance -1 Soft-Decision Reed-Solomon Decoding," IEEE Trans. Info. Theory, vol. 42, no. 3, pp. 704-720, May 1996.
24. E. R. Berlekamp, R. J. McEliece, and H. C. van Tilborg, "On the Inherent Intractability of Certain Coding Problems," IEEE Trans. Info. Theory, vol. 24, no. 3, pp. 384-386, May 1978.
25. E. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
26. C. Berrou, Codes, Graphs, and Systems. Boston: Kluwer Academic, 2002, ch. The Mutations of Convolutional Coding (Around the Trellis), p. 4.
27. C. Berrou and A. Gaviuex, "Near Optimum Error Correcting Coding and Decoding: Turbo Codes," IEEE Trans. Comm., vol. 44, no. 10, pp. 1261-1271, Oct. 1996.
28. C. Berrou, A. Glavieux, and P. Tutimajshima, "Near Shannon Limit Error-Correcting Coding and Decoding: Turbo Codes," in Proc. 1993 IEEE International Conference on Communications, Geneva, Switzerland, 1993, pp. 1064-1070.
29. E. Biglieri, D. Divsalar, P. J. McLane, and M. K. Simon, Introduction to Trellis-Coded Modulation, with Applications. New York: Macmfflan, 1991.
30. P. Billingsley, Probability and Measure. New York: Wiley, 1986.
31. G. Birkhoff and S. MacLane, A Survey of Modern Algebra, 3rd ed. New York: Macmillan, 1965.
32. U. Black, The V Series Recommendations, Protocols for Data Communications. New York: McGraw-Hill, 1991.
33. R. E. Blahut, Theory and Practice of Error Control Codes. Reading, MA: Addison-Wesley, 1983.
34. R. E. Blahut, Fast Algorithms for Digital Signal Processing. Reading, MA: Addison-Wesley, 1985.
35. I. Blake and K. Kith, "On the Complete Weight Enumerator of Reed-Solomon Codes," SIAM J. Disc. Math, vol. 4, no. 2, pp. 164-171, May 1991.
36. R. Bose and D. Ray-Chaudhuri, "On a Class of Error-Correcting Binary Codes," Inf. and Control, vol. 3, pp. 68-79, 1960.
37. A. E. Brouwer, "Bounds on the minimum distance of #-ary linear codes," http://www.win.tue.nl/~aeb/voorlincod.html, 2004.
38. H. Burton, "Inversionless decoding of BCH codes," IEEE Trans. Information Theory, vol. 17, pp. 464-466, 1971.
39. H. Burton and E. Weldon, "Cylic Product Codes," IEEE Trans. Information Theory, vol. 11, pp. 433-140, July 1965.
40. J. B. Cain, G. C. Clark, and J. M. Geist, "Punctured Convolutional Codes of Rate (n - l)/n and Simplified Maximum Likelihood Decoding," IEEE Trans. Info. Theory, vol. 25, no. 1, pp. 97-100, Jan. 1979.
41. A. R. Calderbank and N. J. A. Sloane, "An Eight-Dimensional Trellis Code," IEEE Trans. Info. Theory, vol. 74, no. 5, pp. 757-759, May 1986.
42. A. R. Calderbank and N. J. A. Sloane, "New Trellis Codes Based on Lattices and Cosets," IEEE Trans. Info. Theory, vol. 33, no. 2, pp. 177-195, March 1987.
43. M. Cedervall and R. Johannesson, "A Fast Algorithm for Computing Distance Spectrum of Convolutional Codes," IEEE Trans. Information Theory, vol. 35, pp. 1146-1159, 1989.
44. W. Chambers, "Solution of Welch-Berlekamp Key Equation by Euclidean Algorithm," Electron. Lett., vol. 29, no. 11, p. 1031, 1993.
45. W. Chambers, R. Peile, K. Tsie, and N. Zein, "Algorithm for Solving the Welch-Berlekamp Key-Equation with a Simplified Proof," Electron. Lett., vol. 29, no. 18, pp. 1620-1621,1993.
46. D. Chase, "A Class of Algorithms for Decoding Block Codes With Channel Measurement Information," IEEE Trans. Info. Theory, vol. 18, no. 1, pp. 168-182, Jan. 1972.
47. O. Chauhan, T. Moon, and J. Gunther, "Accelerating the Convergence of Message Passing on Loopy Graphs Using Eigen- messages," in Proc. 37th Annual Asilomar Conference on Signals, Systems, and Computers, 2003, pp. 79-83.
48. P. Chevillat and J. D.J. Costello, "A Multiple Stack Algorithm for Erasurefree Decoding Of Convolutional Codes," IEEE Trans. Comm., vol. 25, pp. 1460-1470, Dec. 1977.
49. R. Chien, "Cyclic Decoding Procedures for Bose-Chaudhuri-Hocquenghem Codes," IEEE Trans. Information Theory, vol. 10, pp. 357-363, 1964.
50. S.-Y. Chung, G. D. Forney, Jr., T. J. Richardson, and R. Urbanke, "On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit," IEEE Commun. Letters, vol. 5, no. 2, pp. 58-60, Feb. 2001.
51. S.-Y. Chung, T. J. Richardson, and Rudiger, "Analysis of Sum-Product Decoding of Low-Density Parity-Check Codes Using Gaussian Approximation," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
52. T. K. Citron, "Algorithms and architectures for error correcting codes," Ph.D. dissertation, Stanford, Aug. 1986.
53. J. H. Conway and N. J. A. Sloane, "Fast Quantizing and Decoding Algorithms for Lattice Quantizers and Codes," IEEE Trans. Info. Theory, vol. 28, no. 2, pp. 227-232, March 1982.
54. J. H. Conway and N. J. A. Sloane, "Voronoi Regions of Lattices, Second Moments of Polytopes, and Quantization," IEEE Trans. Info. Theory, vol. 28, no. 2, pp. 211-226, March 1982.
55. J. H. Conway and N. J. A. Sloane, "On the Voronoi Regions of Certain Lattices," SIAM J. Alg. and Discrete Methods, vol. 5, no. 3, pp. 294-305, September 1984.
56. J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices, and Groups, 2nded. New York: Springer-Verlag, 1993.
57. J. H. Conway and N. J. A. Sloane, "A Fast Encoding Method for Lattice Codes and Quantizers," IEEE Trans. Info. Theory, vol. 29, no. 6, pp. 820-824, November 1983.
58. J. H. Conway and N. J. A. Sloane, "Soft Decoding Techniques for Codes and Lattices, Including the Golay Code and the Leech Lattice," IEEE Trans. Info. Theory, vol. 32, no. 1, pp. 41-50, January 1986.
59. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
60. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties, and Algorithms. New York: Springer-Verlag, 1992.
61. D. Cox, J. Little, and D. O'Shea, Using Algebraic Geometry. New York: Springer-Verlag, 1998.
62. J. Crockett, T. K. Moon, O. Chauhan, and J. Gunther, "Decoding LDPC using multiple-cycle eigenmessages," in Asilomar Conf. on Signals, Systems, and Comp., Monterey, CA, Nov. 2004.
63. D. Dabiri and I. F. Blake, "Fast Parallel Algorithms for Decoding Reed-Solomon Codes based on Remainder Polynomials," IEEE Trans. Info. Theory, vol. 41, no. 4, pp. 873-885, July 1995.
64. F. Daneshgaran, M. Laddomada, and M. Mondin, "Interleaver Design for Serially Concatenated Convolutional Codes: Theory and Applications," IEEE Trans. Information Theory, vol. 50, no. 6, pp. 1177-1188, June 2004.
65. D. G. Daut, J. W. Modestino, and L. D. Wismer, "New Short Constraint Length Convolutional Code Constructions for Selected Rational Rates," IEEE Trans. Info. Theory, vol. 28, no. 5, pp. 794-800, Sept. 1982.
66. M. C. Davey and D. J. MacKay, "Low Density Parity Check Codes Over GF(q)," IEEE Com. Letters, vol. 2, no. 6, 1998.
67. J. R. Deller, J. G. Proakis, and J. H. L. Hansen, Discrete-Time Processing of Speech Signals. New York: Macmillan, 1993.
68. P. Delsarte, "An Algebraic Approach to Coding Theory," Phillips, Research Reports Supplements 10, 1973.
69. D. Divsalar and R. McEliece, "Effective Free Distance of Turbo Codes," Electron. Lett., vol. 32, no. 5, pp. 445-446, Feb. 1996.
70. D. Divsalar and F. Pollara, "Turbo Codes for Deep-Space Communications," Jet Propulsion Laboratory," JPL TDA Progress Report 42-122, pp. 42-120, Feb. 1995.
71. D. Divsalar and M.Simon, "The Design of Coded MPSK for Fading Channel: Performance Criteria," IEEE Trans. Comm., vol. 36, pp. 1013-1021, Sept. 1988.
72. S. Dolinar and D. Divsalar, "Weight Distributions for Turbo Codes Using Random and Nonrandom Permutations," Jet Propulsion Laboratory," JPL TDA Progress Report 42-121, pp. 42-120, Aug. 1995.
73. B. Dorsch, "A Decoding Algorithm for Binary Block Codes and /-ary Output Channels," IEEE Trans. Information Theory, vol. 20, pp. 391-394, May 1974.
74. H. El Gamal and J. A. Roger Hammons, "Analyzing the Turbo Decoder Using the Gaussian Approximation," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 671-686, Feb. 2001.
75. M. Elia, "Algebraic Decoding of the (23,12,7) Golay Code," IEEE Trans. Info. Theory, vol. 33, no. 1, pp. 150-151, Jan. 1987.
76. P. Elias, "Coding for Noisy Channels," IRE Com. Rept. Pt. 4, pp. 37-47, 1955.
77. P. Elias, "List Decoding For Noisy Channels," Res. Lab. Electron., MJT, Cambridge, MA, Tech. Rep. 335, 1957.
78. M. Eyuboglu and G. D. Forney, Jr., "Trellis Precoding: Combined Coding, Preceding and Shaping for Intersymbol Inter{reversed not sign}ference Channels," IEEE Trans. Information Theory, vol. 36, pp. 301-314, Mar. 1992.
79. D. Falconer, "A Hybrid Sequential and Algebraic Decoding Scheme," Ph.D. dissertation, MIT, Cambridge, MA, 1967.
80. R. M. Fano, "A heuristic discussion of probabilistic decoding," IEEE Trans. Info. Theory, vol. 9, pp. 64-73, Apr 1963.
81. G.-L. Feng, "A Fast Special Factorization Algorithm in the Sudan Decoding Procedure for Reed-Solomon Codes," in Proc. 31st Allerton Conf. Communications, Control, and Computing, 2000, pp. 593-602.
82. G.-L. Feng and K. K. Tzeng, "A Generalized Euclidean Algorithm for Multisequence Shift-Register Synthesis," IEEE Trans. Info. Theory, vol. 35, no. 3, pp. 584-594, May 1989.
83. G.-L. Feng and K. K. Tzeng, "A Generalization of the Berlekamp-Massey Algorithm for Multisequence Shift-Register Synthesis With Applications To Decoding Cyclic Codes," IEEE Trans. Info. Theory, vol. 37, no. 5, pp. 1274-1287, Sept. 1991.
84. M. Ferrari and S. Bellini, "Importance Sampling Simulation of Concatenated Block Codes," Proc. of the IEE, vol. 147, pp. 245-251, Oct. 2000.
85. P. Fire, A Class of Multiple-Error-Correcting Binary Codes For Non-independent Errors, Sylvania Report No. RSL-E-2, Sylvania Electronic Defense Laboratory, Reconnaissance Systems Division, Mountain View, CA, Mar. 1959.
86. G. D. Forney, Jr., "On Decoding BCH Codes," IEEE Trans. Info. Theory, vol. 11, no. 4, pp. 549-557, Oct 1965.
87. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966.
88. G. D. Forney, Jr., "Generalized Minimum Distance Decoding," IEEE Trans. Info. Theory, vol. 12, no. 2, pp. 125-131, Apr. 1966.
89. G. D. Forney, Jr., "The Viterbi Algorithm," Proc. IEEE, pp. 268-278, Mar. 1973.
90. G. D. Forney, Jr., "Convolutional Codes IE: Sequential Decoding," Inform. Control, vol. 25, pp. 267-297, July 1974.
91. G. D. Forney, Jr., "Coset Codes - Part I: Introduction and Geometrical Classification," IEEE Trans. Info. Theory, vol. 34, no. 5, pp. 1123-1151, September 1988.
92. G. D. Forney, Jr., "Coset Codes - Part U: Binary Lattices and Related Codes," IEEE Trans. Info. Theory, vol. 34, no. 5, pp. 1152-1187, September 1988.
93. G. D. Forney, Jr., "Geometrically Uniform Codes," IEEE Trans. Information Theory, vol. 37, pp. 1241-1260, 1991.
94. G. D. Forney, Jr., "Trellis Shaping," IEEE Trans. Info. Theory, vol. 38, no. 2, pp. 281-300, Mar. 1992.
95. G. D. Forney, Jr., "Codes on Graphs: Normal Realizations," IEEE Trans. Info. Theory, vol. 47, no. 2, pp. 520-548, Feb. 2001.
96. G. D. Forney, Jr., "Maximum-likelihood Sequence Estimation of Digital Sequences in the Presence of Intersymbol Interference," IEEE Trans. Info. Theory, vol. IT-18, no. 3, pp. 363-378, May 1972.
97. G. D. Forney, Jr., "Convolutional Codes I: Algebraic Structure," IEEE Trans. Info. Theory, vol. 16, no. 6, pp. 720-738, Nov. 1970.
98. G. D. Forney, Jr., L. Brown, M. V. Eyuboglu, and I. John L. Moran, "The V.34 High-Speed Modem Standard," IEEE Communications Magazine, vol. 34, pp. 28-33, Dec. 1996.
99. G. D. Forney, Jr. and M. Eyuboglu, "Combined Equalization and Coding Using Precoding," IEEE Commun. Mag., vol. 29, no. 12, pp. 25-34, Dec. 1991.
100. G. D. Forney, Jr., R. G. Gallager, G. R. Lang, F. M. Longstaff, and S. U. Qureshi, "Efficient Modulation for Band-Limited Channels," IEEE J. on Selected Areas in Comm., vol. 2, no. 5, pp. 632-647, September 1984.
101. G. Foschini and M. Gans, "On Limits of Wireless Communications in a Fading Environment," Wireless Personal Comm., vol. 6, no. 3, pp. 311-355, Mar. 1998.
102. M. P. Fossorier, F. Burkert, S.Lin, and J. Hagenauer, "On the Equivalence Between SOVA and Max-Log-MAPDecodings," IEEE Comm. Letters, vol. 2, no. 5, pp. 137-139, May 1998.
103. M. P. Fossorier and S. Lin, "Chase-Type and GMD-Type Coset Decoding," IEEE Trans. Comm., ml. 48, pp. 345-350, Mar. 2000.
104. M. Fossorier and S. Lin, "Soft-Decision Decoding of Linear Block Codes Based on Ordered Statistics," IEEE Trans. Information Theory, vol. 41, pp. 1379-1396, Sept. 1995.
105. M. Fossorier and S. Lin, "Differential Trellis Decoding of Convolutional Codes," IEEE Trans. Information Theory, vol. 46, pp. 1046-1053, May 2000.
106. J. B. Fraleigh, A First Course in Abstract Algebra. Reading, MA: Addison-Wesley, 1982.
107. B. Frey, Graphical Models for Machine Learning and Digital Communication. Cambridge, MA: MIT Press, 1998.
108. B.J. Frey and D.J. MacKay, "A Revolution: Belief Propagation in Graphs With Cycles," in Advances in Neural Information Processing Systems. MIT Press, 1998.
109. B. Friedland, Control System Design: An Introduction to State-Space Design. New York: McGraw-Hill, 1986.
110. G. Szego, Orthogonal Polynomials, 3rd ed. Providence, RI: American Mathematical Society, 1967.
111. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
112. R. G. Gallager, "Low-Density Parity-Check Codes," IRE Trans, on Info. Theory, vol. iT-8, pp. 21-28, Jan. 1962.
113. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: M.I.T. Press, 1963.
114. S. Gao and M. A. Shokrollahi, "Computing Roots of Polynomials over Function Fields of Curves," in Coding Theory and Cryptography, D. Joyner, Ed. Springer-Verlag, 1999, pp. 214-228.
115. J. Geist, "An Empirical Comparison of Two Sequential Decoding Algorithms," IEEE Trans. Comm. Tech., vol. 19, pp. 415-419, Aug. 1971.
116. J. Geist, "Search Properties for Some Sequential Decoding Algorithms," IEEE Trans. Information Theory, vol. 19, pp. 519-526, July 1973.
117. A. Geramita and J. Seberry, Orthogonal Designs, Quadratic Forms and Hadamard Matrices, ser. Lecture Notes in Pure and Applied Mathematics, v. 43. New York and Basel: Marcel Dekker, 1979.
118. R. Gold, "Maximal Recursive Sequences with 3-Valued Recursive Cross-Correlation Functions," IEEE Trans. Info. Theory, pp. 154-156, 1968.
119. J. Geist, "Optimal Binary Sequences for Spread Spectrum Multiplexing," IEEE Trans. Info. Theory, pp. 619-621, October 1967.
120. S. W. Golomb, Shift Register Sequences. San Francisco: Holden-Day, 1967.
121. G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed. Baltimore, MD: Johns Hopkins University Press, 1996.
122. M. Gonzalez-Lopez, L. Castedo, and J. Garci'a-Frfas, "BICM for MMO Systems Using Low-Density Generator Matrix (LDGM) Codes," in Proc. International Conference on Acoustics, Speech, and Signal Processing. IEEE, May 2004.
123. V.Goppa, "Codes on Algebraic Curves," Soviet Math. DoU., vol. 24, pp. 170-172, 1981.
124. V.Goppa, Geometry and Codes. Dordrecht: Kluwer Academic, 1988.
125. D. Gorenstein and N. Zierler, "A Class of Error Correcting Codes in pm Symbols," J. Society oflndust. Appl. Math., vol. 9, pp. 207-214, June 1961.
126. R. Graham, D. Knuth, and O. Patashnik, Concrete Mathematics. Reading, MA: Addison-Wesley, 1989.
127. J. Gunther, M. Ankapura, and T. Moon, "Blind Turbo Equalization Using a Generalized LDPC Decoder," in Proc. 11th Digital Signal Processing Workshop, Taos Ski Valley, NM, Aug. 2004, pp. 206-210.
128. V. Guruswami and M. Sudan, "Improved Decoding of Reed-Solomon Codes and Algebraic Geometry Codes," IEEE Trans. Info. Theory, vol. 45, no. 6, pp. 1757-1767, Sept. 1999.
129. D. Haccoun and M. Ferguson, "Generalized Stack Algorithms for Decoding Convolutional Codes," IEEE Trans. Information Theory, vol. 21, pp. 638-651, Apr. 1975.
130. J. Hagenauer, "Rate Compatible Punctured Convolutional Codes and Their Applications," IEEE Trans. Comm., vol. 36, pp. 389-400, Apr. 1988.
131. J. Hagenauer, "Source-Controlled Channel Decoding," IEEE Trans. Comm., vol. 43, no. 9, pp. 2449-2457, Sept. 1995.
132. J. Hagenauer and P. Hoeher, "A Viterbi Algorithm with Soft-Decision Outputs and Its Applications," in Proc. Globecom, Dallas, TX, Nov. 1989, pp. 1680-1686.
133. J. Hagenauer, E. Offer, and L. Papke, Reed Solomon Codes and Their Applications. New York: IEEE Press, 1994, ch. Matching Viterbi Decoders and Reed-Solomon Decoders in a Concatenated System.
134. J. Hagenauer, E. Offer, and L. Papke, "Iterative Decoding of Binary Block and Convolutional Codes," IEEE Trans. Info. Theory, vol. 42, no. 2, pp. 429-145, Mar. 1996.
135. D. Haley, A. Grant, and J. Buetefuer, "Iterative encoding of low-density parity-check codes," in Global Communication Conference (GLOBECOM). IEEE, Nov. 2002, pp. 1289-1293.
136. R. W. Hamming, Coding and Information Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 1986.
137. R. Hamming, "Error detecting and error correcting codes," Bell Syst. Tech. Journal, vol. 29, pp. 41-56, 1950.
138. A. R. Hammonds, Jr., P. V. Kummar, A. Calderbank, N. Sloane, and P. Sole, "The Z4-Linearity of Kerdock, Preparata, Goethals, and Related Codes," IEEE Trans. Info. Theory, vol. 40, no. 2, pp. 301-319, Mar. 1994.
139. Y. Han, C. Hartmann, and C. Chen, "Efficient Priority-First Search Maximum-Likelihood Soft-Decision Decoding of Linear Block Codes," IEEE Trans. Information Theory, vol. 39, pp. 1514-1523, Sept. 1993.
140. Y. Han, C. Hartmann, and K. Mehrota, "Decoding Linear Block Codes Using a Priority-First Search: Performance Analysis and Suboptimal Version," IEEE Trans. Information Theory, vol. 44, pp. 1233-1246, May 1998.
141. L. Hanzo,T. Liew, and B. Yeap, Turbo Coding, Turbo Equalization and Space-Time Coding for Transmission Over Fading Channels. West Sussex, England: Wiley, 2002.
142. H. Harashima and H. Miyakawa, "Matched-transmission Technique for Channels with Intersymbol Interference," IEEE Trans. Comm., vol. 20, pp. 774-780, Aug. 1972.
143. C. Hartmann and K. Tzeng, "Generalizations of the BCH Bound," Inform. Contr., vol. 20, no. 5, pp. 489-498, June 1972.
144. C. Hartmann, K. Tzeng, and R. Chen, "Some Results on the Minimum Distance of Cyclic Codes," IEEE Trans. Information Theory, vol. 18, no. 3, pp. 402-t09, May 1972.
145. H. Hasse, "Theorie der hoen Differentiale in einem algebraishen Funcktionenkoper mit volkommenem Kostantenkoerp bei Charakteristic," J. Reine. Ang. Math., pp. 50-54, 175.
146. C. Heegard and S. B. Wicker, Turbo Coding. Boston: Kluwer Academic, 1999.
147. J. Heller, "Short Constraint Length Convolutional Codes," Jet Propulsion Labs," Space Programs Summary 37-54, v. Ill, pp. 171-177, 1968.
148. J. Heller and I. M. Jacobs, "Viterbi Decoding for Satellite and Space Communications," IEEE Trans. Com. Tech., vol. 19, no. 5, pp. 835-848, Oct. 1971.
149. F. Hemmati and D. Costello, "Truncation Error Probability in Viterbi Decoding," IEEE Trans. Comm., vol. 25, no. 5, pp. 530-532, May 1977.
150. B. Hochwald and W. Sweldons, "Differential Unitary Space-Time Modulation," Bell Labs," Lucent Technology Technical Report, 1999.
151. A. Hocquenghem, "Codes Correcteurs D'erreurs," Chiffres, vol. 2, pp. 147-156, 1959.
152. J. K. Holmes and C. C. Chen, "Acquisition time performance of PN spread-spectrum systems," IEEE Transactions on Communications, vol. COM-25, no. 8, pp. 778-783, August 1977.
153. R. A. Horn and C. A. Johnson, Matrix Analysis. Cambridge: Cambridge University Press, 1985.
154. B. Hughes, "Differential Space-Time Modulation," in Proc. IEEE Wireless Commun. Networking Conf., New Orleans, LA, Sept. 1999.
155. T. W. Hungerford, Algebra. New York: Springer-Verlag, 1974.
156. S. Ideda, T. Tanaka, and S. Amari, "Information Geometry of Turbo and Low-Density Parity-Check Codes," IEEE Trans. Info. Theory, vol. 50, no. 6, pp. 1097-1114, June 2004.
157. K. A. S. Immink, "Runlength-Limited Sequences," Proceedings of the IEEE, vol. 78, pp. 1745-1759, 1990.
158. K. A. S. Immink, Coding Techniques for Digital Recorders. Englewood Cliffs, NJ: Prentice-Hall, 1991.
159. K. Immink, Reed Solomon Codes and Their Applications. New York: IEEE Press, 1994, ch. RS Code and the Compact Disc.
160. International Telegraph and Telephone Consultive Committee (CCITT), "Recommendation v.29: 9600 bits per second modem standardized for use on point-to-point 4-wire leased telephone-type circuits," in Data Communication over the Telephone Network "Blue Book". Geneva: International Telecommunications Union, 1988, vol. VIU, pp. 215-227.
161. I. Jacobs and E. Berlekamp, "A Lower Bound to the Distribution of Computation for Sequential Decoding," IEEE Trans. Information Theory, vol. 13, pp. 167-174, Apr. 1967.
162. N. Jacobson, Basic Algebra I. New York: Freeman, 1985.
163. W. Jakes, Microwave Mobile Communication. New York, NY: IEEE Press, 1993.
164. F. Jelinek, "An Upper Bound on Moments of Sequential Decoding Effort," IEEE Trans. Information Theory, vol. 15, pp. 140-149, Jan. 1969.
165. F. Jelinek, "Fast Sequential Decoding Algorithm Using a Stack," IBM J. Res. Develop., pp. 675-685, Nov. 1969.
166. F. Jelinek and J. Cocke, "Bootstrap Hybrid Decoding for Symmetric Binary Input Channels," Inform. Control., vol. 18, pp. 261-281, Apr. 1971.
167. H. Jin, A. Khandekar, and R. McEliece, "Irregular Repeat-Accumulate Codes," in Proceedings 2nd International Symposium on Turbo Codes and Related Topics, Brest, France, Sept. 2000, pp. 1-8.
168. O. Joerssen and H. Meyr, "Terminating the Trellis of Turbo-Codes," Electron. Lett., vol. 30, no. 16, pp. 1285-1286, 1994.
169. R. Johannesson, "Robustly Optimal Rate One-Half Binary Convolutional Codes," IEEE Trans. Information Theory, vol. 21, pp. 46-468, July 1975.
170. R. Johannesson, "Some Long Rate One-Half Binary Convolutional Codes with an Optimum Distance Profile," IEEE Trans. Information Theory, vol. 22, pp. 629-631, Sept. 1976.
171. R. Johannesson, "Some Rate 1/3 and 1/4 Binary Convolutional Codes with an Optimum Distance Profile," IEEE Trans. Information Theory, vol. 23, pp. 281-283, Mar. 1977.
172. R. Johannesson and E. Paaske, "Further Results on Binary Convolutional Codes with an Optimum Distance Profile," IEEE Trans. Information Theory, vol. 24, pp. 264-268, Mar. 1978.
173. R. Johannesson and P. Stahl, "New Rate 1/2, 1/3, and 1/4 Binary Convolutional Encoders With Optimum Distance Profile," IEEE Trans. Information Theory, vol. 45, pp. 1653-1658, July 1999.
174. R. Johannesson and K. Zigangirov, Fundamentals of Convolutional Coding. Piscataway, NJ: IEEE Press, 1999.
175. R. Johannesson and Z.-X. Wan, "A Linear Algebra Approach to Minimal Convolutional Encoders," IEEE Trans. Information Theory, vol. 39, no. 4, pp. 1219-1233, July 1993.
176. S. Johnson and S. Weller, "Construction of Low-Density Parity-Check Codes from Kirkman Triple Systems," in Global Communications Conference (GLOBECOM), Nov 25-29, 2001, pp. 970-974.
177. S. Johnson and S. Weller, "Regular Low-Density Parity-Check Codes from Combinatorial Designs," in Information Theory Workshop, 2001, pp. 90-92.
178. S. Johnson and S. Weller, "Higher-Rate LDPC Codes from Unital Designs," in Global Telecommunications Conference (GLOBECOM). IEEE, 2003, pp. 2036-2040.
179. S. Johnson and S. Weller, "Resolvable 2-designs for Regular Low-Density Parity Check Codes," IEEE Trans. Comm., vol. 51, no. 9, pp. 1413-1419, Sept. 2003.
180. P. Jung and M. Nasshan, "Dependence of the Error Performance of Turbo-Codes on the Interleaver Structure in Short Frame Transmission Systems,"Electron. Lett., vol 30, no. 4, pp. 287-288, Feb. 1994.
181. T. Kailath, Linear Systems. Englewood Cliffs, NJ: Prentice-Hall, 1980.
182. T. Kaneko, T. Nishijima, and S. Hirasawa, "An Improvement of Soft-Decision Maximum-Likelihood Decoding Algorithm Using Hard-Decision Bounded-Distance Decoding," IEEE Trans. Information Theory, vol. 43, pp. 1314-1319, July 1997.
183. T. Kaneko, T. Nishijima, H. Inazumi, and S. Hirasawa, "An Efficient Maximum Likelihood Decoding of Linear Block Codes with Algebraic Decoder," IEEE Trans. Information Theory, vol. 40, pp. 320-327, Mar. 1994.
184. T. Kasami, "A Decoding Method for Multiple-Error-Correcting Cyclic Codes by Using Threshold Logics," in Conf. Rec. Inf. Process. Soc. of Japan (in Japanese), Tokyo, Nov. 1961.
185. T. Kasami, "A Decoding Procedure for Multiple-Error-Correction Cyclic Codes," IEEE Trans. Information Theory, vol. 10, pp. 134-139, Apr. 1964.
186. T. Kasami, S. Lin, and W. Peterson, "Some Results on the Weight Distributions of BCH Codes," IEEE Trans. Information Theory, vol. 12, no. 2, p. 274, Apr. 1966.
187. D. E. Knuth, 77K Art of Computer Programming. Reading, MA: Addison-Wesley, 1997, vol. 1.
188. R.Koetter, "On Algebraic Decoding of Algebraic-Geometric and Cyclic Codes," Ph.D. dissertation, University of Linkoping, 1996.
189. R. Koetter and A.Vardy, "The Structure of Tail-Biting Trellises: Minimality and Basic Principles," IEEE Trans. Information Theory, vol. 49, no. 9, pp. 2081-2105, Sept. 2003.
190. R. Koetter, A. C. Singer, and M. Tiichler, "Turbo Equalization," IEEE Signal Processing Magazine, vol. 21, no. 1, pp. 67-80, Jan. 2004.
191. R. Koetter and A. Vardy, "Algebraic Soft-Decision Decoding of Reed-Solomon Codes," IEEE Trans. Info. Theory, vol. 49, no. 11, pp. 2809-2825, Nov. 2003.
192. V. Kolesnik, "Probability decoding of majority codes," Probl. Peredachi Inform., vol. 7, pp. 3-12, July 1971.
193. R. Kötter, "Fast Generalized Minimum Distance Decoding of Algebraic-Geometry and Reed-Solomon Codes," IEEE Trans. Info. Theory, vol. 42, no. 3, pp. 721-737, May 1996.
194. Y. Kou, S. Lin, and M. P. Fossorier, "Low-Density Parity-Check Codes Based on Finite Geometries: A Rediscovery and New Results," IEEE Trans. Info. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
195. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor Graphs and the Sum-Product Algorithm," IEEE Trans. Info. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
196. R. Laroia, N. Farvardin, and S. A. Tretter, "On Optimal Shaping of Multidimensional Constellations," IEEE Trans. Info. Theory, vol. 40, no. 4, pp. 1044-1056, July 1994.
197. K. Larsen, "Short Convolutional Codes with Maximal Free Distance for Rates 1/2, 1/3 and 1/4," IEEE Trans. Info. Theory, vol. 19, pp. 371-372, May 1973.
198. L. Lee, Convolutional Coding: Fundamentals and Applications. Boston, MA: Artech House, 1997.
199. N. Levanon, Radar Principles. New York: Wiley Interscience, 1988.
200. R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison-Wesley, 1983.
201. R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications. Cambridge: Cambridge University Press, 1986.
202. S. Lin and E. Weldon, "Further Results on Cyclic Product Codes," IEEE Trans. Information Theory, vol. 6, no. 4, pp. 452-159, July 1970.
203. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1983.
204. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2004.
205. S. Lin, T. Kasami, T. Fujiwara, and M. Forrorier, Trellises and Trellis-based Decoding Algorithms for Linear Block Codes. Boston: Kluwer Academic Publishers, 1998.
206. D. Lind and B. Marcus, Symbolic Dynamics and Coding. Cambridge, England: Cambridge University Press, 1995.
207. J. Lodge, P. Hoeher, and J. Hagenauer, "The Decoding of Multidimensional Codes Using Separable MAP 'Filters'," in Proc. 16th Biennial Symp. on Comm., Queen's University, Kingston, Ont. Canada, May 1992, pp. 343-346.
208. J. Lodge, R. Young, P. Hoeher, and J. Hagenauer, "Separable MAP 'Filters' for the Decoding of Product and Concatenated Codes," in Proc. IEEE Int. Conf. on Comm., Geneva, Switzerland, May 1993, pp. 1740-1745.
209. H.-A. Loeliger, "An Introduction to Factor Graphs," IEEE Signal Processing Mag., vol. 21, no. l,pp. 28-H, Jan. 2004.
210. T. D. Lookabaugh and R. M. Gray, "High-Resolution Quantization Theory and the Vector Quantizer Advantage," IEEE Trans. Info. Theory, vol. 35, no. 5, pp. 1020-1033, September 1989.
211. D. Lu and K. Yao, "Improved Importance Sampling Technique for Efficient Simulation of Digital Communication Systems," IEEE Journal on Selected Areas in Communications, vol. 6, no. 1, pp. 67-75, Jan. 1988.
212. M. G. Luby, M. Miteznmacher, M. A. Shokrollahi, andD. A. Spielman, "Improved Low-Density Parity-Check Codes Using irregular Graphs," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
213. H. Ma and J. Wolf, "On Tailbiting Codes," IEEE Trans. Comm., vol. 34, pp. 104-111, Feb. 1986.
214. X. Ma and X.-M. Wang, "On the Minimal Interpolation Problem and Decoding RS Codes," IEEE Trans. Info. Theory, vol. 46, no. 4, pp. 1573-1580, July 2000.
215. D. J. MacKay, http://www.inference.phy.cam.ac.uk/mackay/CodesFiles.html.
216. D. J. MacKay, "Near Shannon Limit Performance of Low Density Parity Check Codes," Electron. Lett., vol. 33, no. 6, pp. 457-158, Mar 1997.
217. D. J. MacKay, "Good Error-Correcting Codes Based on Very Sparse Matrices," IEEE Trans. Info. Theory, vol. 45, no. 2, pp. 399-431, March 1999.
218. D. J. MacKay and R. M. Neal, "Good Codes Based on Very Sparse Matrices," in Cryptography and Coding 5th IMA Conference, ser. Lecture Notes in Computer Science, C. Boyd, Ed. Springer, 1995, vol. 1025, pp. 100-111.
219. F. MacWilliams, "A Theorem on the Distribution of Weights in a Systematic Code," Bell Syst. Tech. Journal, vol. 42, pp. 79-94, 1963.
220. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland, 1977.
221. S. J. Mason, "Feedback Theory-Some Properties of Signal Flow Graphs," Proceedings IRE, pp. 1144-1156, September 1953.
222. J. L. Massey, "Shift-Register Synthesis and BCH Decoding," IEEE Trans. Info. Theory, vol. IT-15, no. 1, pp. 122-127, 1969.
223. J. L. Massey, "Variable-Length Codes and the Fano Metric," IEEE Trans. Info. Theory, vol. IT-18, no. 1, pp. 196-198, Jan. 1972.
224. J. Massey, Threshold Decoding. Cambridge, MA: MIT Press, 1963.
225. J. Massey, "Coding and Modulation in Digital Communications," in Proc. Int. Zurich Seminar on Dig. Comm., Zurich, Switzer- land, 1974, pp. E2(l)-E2(4).
226. J. Massey and M. Sain, "Inverses of Linear Sequential Circuits," IEEE Trans. Comp., vol. 17, pp. 330-337, Apr. 1968.
227. 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. Info. Theory, vol. 23, no. 2, pp. 157-166, Mar. 1977.
228. R. McEliece, The Theory of Information and Coding, ser. Encyclopedia of Mathematics and its Applications. Reading, MA: Addison-Wesley, 1977.
229. R. McEliece, "A Public-Key Cryptosystem Based On Algebraic Coding Theory," JPL, DSN Progress Report 42-44, January and February 1978.
230. R. McEliece, "The Guruswami-Sudan Algorithm for Decoding Reed-Solomon Codes," JPL, IPN Progress Report 42-153, May 15, 2003 2003, available at http://iprn.jpl.nasa.gov/progress_report/42-153/.
231. R. McEliece and L. Swanson, Reed-Solomon Codes and Their Applications. New York: IEEE Press, 1994, ch. Reed-Solomon Codes and the Exploration of the Solar System, pp. 25-40.
232. R. J. McEliece, D. J. MacKay, and J.-F. Cheng, "Turbo Decoding as an Instance of Pearl's Belief Propagation Algorithm," IEEE J. on Selected Areas in Comm., vol. 16, no. 2, pp. 140-152, Feb. 1998.
233. R.J. McEliece, E. R. Rodemich, and J.-F. Cheng, "The Turbo Decision Algorithm," in Proc. 33rd AnnualAllerton Conference on Communication, Control, and Computing, 1995, pp. 366-379.
234. R. J. McEliece and J. B. Shearer, "A Property of Euclid's Algorithm and an Application to Pade Approximation," SLAM J. Appl. Math, vol. 34, no. 4, pp. 611-615, June 1978.
235. R. J. McEliece and M. Yildrim, "Belief Propagation on Partially Ordered Sets," in Mathematical Systems Theory in Biology, Communications, Computation, and Finance, D. Gilliam and J. Rosenthal, Eds. IMA, 2003, available at http://www.systems.caItech.edu/EE/Faculty/rjm/.
236. G. V. Meerbegen, M. Moonen, and H. D. Man, "Critically Subsampled Filterbanks Implementing Reed-Solomon Codes," in Proc. International Conference on Acoustics, Speech, and Signal Processing. Montreal, Canada: IEEE, May 2004, pp. H-989-992.
237. J. Meggitt, "Error Correcting Codes and their Implementations," IRE Trans. Info. Theory, vol. 7, pp. 232-244, Oct. 1961.
238. A. Michelson and A. Levesque, Error Control Techniques for Digital Communication. New York: Wiley, 1985.
239. W. Mills, "Continued Fractions and Linear Recurrences," Mathematics of Computation, vol. 29, no. 129, pp. 173-180, Jan. 1975.
240. M. Mitchell, "Coding and Decoding Operation Research," G.E. Advanced Electronics Final Report on Contract AF 19 (604)-6183, Air Force Cambridge Research Labs, Cambridge, MA, Tech. Rep., 1961.
241. M. Mitchell, "Error-Trap Decoding of Cyclic Codes," G.E. Report No. 62MCD3, General Electric Military Communications Dept., Oklahoma City, OK, Tech. Rep., Dec. 1962.
242. T. K. Moon, "Wavelets and Orthogonal (Lattice) Spaces," International Symposium on Information Theory, p. 250, 1995.
243. T. K. Moon and S. Budge, "Bit-Level Erasure Decoding of Reed-Solomon Codes Over GF(2n)" in Proc. Asilomar Conference on Signals and Systems, 2004, pp. 1783-1787.
244. T. K. Moon and J. Gunther, "On the Equivalence of Two Welch-Berlekamp Key Equations and their Error Evaluators," IEEE Trans. Information Theory, vol. 51, no. 1, pp. 399-401, 2004.
245. T. Moon, "On General Linear Block Code Decoding Using the Sum-Product Iterative Decoder," IEEE Comm. Lett., 2004, (accepted for publication).
246. T. K. Moon and W. C. Stirling, Mathematical Methods and Algorithms for Signal Processing. Upper Saddle River, NJ: Prentice-Hall, 2000.
247. M. Morii and M. Kasahara, "Generalized Key-Equation of Remainder Decoding Algorithm for Reed-Solomon Codes," IEEE Trans. Info. Theory, vol. 38, no. 6, pp. 1801-1807, Nov. 1992.
248. D. Muller, "Application of Boolean Switching Algebra to Switching Circuit Design," IEEE Trans, on Computers, vol. 3, pp. 6-12, Sept. 1954.
249. A. Naguib, N. Seshadri, and A. Calderbank, "Increasing Data Rate over Wireless Channels," IEEE Signal Processing Magazine, pp. 76-92, May 2000.
250. I. Niven, H. S. Zuckerman, and H. L. Montgomery, An Introduction to the Theory of Numbers, 5th ed. New York: Wiley, 1991.
251. J. Odenwalder, "Optimal Decoding of Convolutional Codes," Ph.D. dissertation, Department of Systems Sciences, School of Engineering and Applied Sciences, University of California, Los Angeles, 1970.
252. V. Olshevesky and A. Shokrollahi, "A Displacement Structure Approach to Efficient Decoding of Reed-Solomon and Algebraic-Geometric Codes," in Proc. 31st ACM Symp. Theory of Computing, Atlanta, GA, May 1999.
253. A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing. Englewood Cliffs, NJ: Prentice-Hall, 1989.
254. E. Paaske, "Short Binary Convolutional Codes with Maximal Free Distance For Rate 2/3 and 3/4," IEEE Trans. Information Theory, vol. 20, pp. 683-689, Sept. 1974.
255. A. Papoulis, Probability, Random Variables, and Stochastic Processes, 2nd ed. New York: McGraw Hill, 1984.
256. N. Patterson, "The Algebraic Decoding of Goppa Codes," IEEE Trans. Info. Theory, vol. 21, no. 2, pp. 203-207, Mar. 1975.
257. P. Pazkad and V. Anantharam, "A New Look at the Generalized Distributive Law," IEEE Trans. Info. Theory, vol. 50, no. 6, pp. 1132-1155, June 2004.
258. J. Pearl, Probabilistic Reasoning in Intelligent Systems. San Mateo, CA: Morgan Kaufmann, 1988.
259. L. Perez, J. Seghers, and D. Costello, "A Distance Spectrum Interpretation of Turbo Codes," IEEE Trans. Information Theory, vol. 42, pp. 1698-1709, Nov. 1996.
260. W. W. Peterson, Error-correcting Codes. Cambridge, MA and New York: MIT Press and Wiley, 1961.
261. W. Peterson, "Encoding and Error-Correction Procedures for the Bose-Chaudhuri Codes," IEEE Trans. Information Theory, vol. 6, pp. 459-470, 1960.
262. W. Peterson and E. Weldon, Error Correction Codes. Cambridge, MA: MIT Press, 1972.
263. S. Pietrobon, G. Ungerbock, L. Perez, and D. Costello, "Rotationally Invariant Nonlinear Trellis Codes for Two-Dimensional Modulation," IEEE Trans. Information Theory, vol. 40, no. 6, pp. 1773-1791, 1994.
264. S. S. Pietrobon and D. J. Costello, "Trellis Coding with Multidimensional QAM Signal Sets," IEEE Trans. Info. Theory, vol. 29, no. 2, pp. 325-336, Mar. 1993.
265. S. S. Pietrobon, R. H. Deng, A. Lafanechere, G. Ungerboeck, and D. J. Costello, "Trellis-Coded Multidimensional Phase Modulation," IEEE Trans. Info. Theory, vol. 36, no. 1, pp. 63-89, Jan. 1990.
266. M. Plotkin, "Binary Codes With Specified Minimum Distances," IEEE Trans. Information Theory, vol. 6, pp. 445-450, 1960.
267. H. V. Poor, An Introduction to Signal Detection and Estimation. New York: Springer-Verlag, 1988.
268. J. Porath and T. Aulin, "Algorithm Construction of Trellis Codes," IEEE Trans. Comm., vol. 41, no. 5, pp. 649-654, 1993.
269. A. B. Poritz, "Hidden Markov Models: A Guided Tour," in Proceedings oflCASSP, 1988.
270. G. Pottie and D. Taylor, "A Comparison of Reduced Complexity Decoding Algorithms for Trellis Codes," IEEE Journal on Selected Areas in Communications, vol. 7, no. 9, pp. 1369-1380, 1989.
271. E. Prange, "Cyclic Error-Correcting Codes in Two Symbols," Air Force Cambridge Research Center, Cambridge, MA, Tech. Rep. TN-57-103, Sept. 1957.
272. E. Prange, "Some Cyclic Error-Correcting Codes with Simple Decoding Algorithms," Air Force Cambridge Research Center, Cambridge, MA, Tech. Rep. TN-58-156, Apr. 1958.
273. E. Prange, "The Use of Coset Equivalence in the Analysis and Decoding of Group Codes," Air Force Cambridge Research Center, Cambridge, MA, Tech. Rep. TN-59-164,1959.
274. O. Pretzel, Codes and Algebraic Curves. Oxford: Clarendon Press, 1998.
275. J. G. Proakis, Digital Communications, 3rd ed. New York: McGraw-Hill, 1995.
276. J. G. Proakis and M. Salehi, Communication Systems Engineering. Upper Saddle River, NJ: Prentice-Hall, 1994.
277. M. Puschel and J. Moura, "The Algebraic Approach to the Discrete Cosine and Sine Transforms and Their Fast Algorithms," SIAM J. of Computing, vol. 32, no. 5, pp. 1280-1316, 2003.
278. R. Pyndiah, A. Glavieux, A. Picart, and S. Jacq, "Near Optimum Decoding of Product Codes," in IEEE Global Telecom{reversed not sign}munications Conference. San Francisco: IEEE, Nov. 1994, pp. 339-343.
279. R. M. Pyndiah, "Near-Optimum Decoding of Product Codes: Block Turbo Codes," IEEE Trans. Comm., vol. 46, no. 8, pp. 1003-1010, Aug. 1998.
280. L. R. Rabiner, "A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition," Proc. IEEE, vol. 77, no. 2, pp. 257-286, February 1989.
281. T. V. Ramabadran and S. S. Gaitonde, "A Tutorial On CRC Computations," IEEE Micro, pp. 62-75, Aug. 1988.
282. J. Ramsey, "Realization of Optimum Interleavers," IEEE Trans. Information Theory, vol. 16, pp. 338-345, May 1970.
283. I. Reed, T.-K. Truong, X. Chen, and X. Yin, "Algebraic Decoding of the (41,21,9) Quadratic Residue Code," IEEE Trans. Information Theory, vol. 38, no. 3, pp. 974-986, May 1992.
284. I. Reed, "A Class of Multiple-Error-Correcting Codes and a Decoding Scheme," IEEE Trans. Information Theory, vol. 4, pp. 38-19, Sept. 1954.
285. I. Reed, R. Scholtz, T. Truong, and L. Welch, "The Fast Decoding of Reed-Solomon Codes Using Fermat Theoretic Transforms and Continued Fractions," IEEE Trans. Info. Theory, vol. 24, no. 1, pp. 100-106, Jan. 1978.
286. I. Reed and G. Solomon, "Polynomial Codes over Certain Finite Fields," J. Soc. Indust. Appl. Math, vol. 8, pp. 300-304, 1960.
287. I. Reed, X. Yin, and T.-K. Truong, "Algebraic Decoding of (32,16,8) Quadratic Residue Code," IEEE Trans. Information Theory, vol. 36, no. 4, pp. 876-880, July 1990.
288. T. J. Richardson and R. Urbanke, Iterative Coding Systems, (available online), March 30, 2003.
289. T. J. Richardson and R. L. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
290. T. J. Richardson and R. Urbanke, "The Capacity of Low-Density Parity-Check Codes Under Message-Passing Decoding," IEEE Trans. Info. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
291. T. J. Richardson, "Error Floors of LDPC Codes," www.ldpc-codes.com/papers/ErrorFloors.pdf.
292. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of Capacity-Approaching Irregular Low-Density Parity-Check Codes," IEEE Trans. Information Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
293. R. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Comm. of the ACM, vol. 21, no. 2, pp. 120-126, 1978.
294. P. Robertson, "Illuminating the Structure of Parallel Concatenated Recursive (TURBO) Codes," in Proc. GLOBECOM, vol. 3, San Francisco, CA, Nov. 1994, pp. 1298-1303.
295. P. Robertson, E. Villebrun, and P. Hoher, "A Comparison of Optimal and Sub-Optimal MAP Decoding Algorithms Operating in the Log Domain," in Proc. of the Int'l Conf. on Comm. (ICC), Seattle, WA, June 1995, pp. 1009-1013.
296. C. Roos, "A New Lower Bound for the Minimum Distance of a Cyclic Code," IEEE Trans. Information Theory, vol. 29, no. 3, pp. 330-332, May 1983.
297. R. M. Roth and G. Ruckenstein, "Efficient Decoding of Reed-Solomon Codes Beyond Half the Minimum Distance," IEEE Trans. Info. Theory, vol. 46, no. 1, pp. 246-256, Jan. 2000.
298. L. Rudolph, "Easily Implemented Error-Correction Encoding-Decoding," G.E. Report 62MCD2, General Electric Corpo{reversed not sign}ration, Oklahoma City, OK, Tech. Rep., Dec. 1962.
299. L. Rudolph, "A Class of Majority Logic Decodable Codes," IEEE Trans. Information Theory, vol. 13, pp. 305-307, Apr. 1967.
300. S. Sankaranarayanan, A. Cvetkovifc, and B. Vasic, "Unequal Error Protection for Joint Source-Channel Coding Schemes," in Proceedings of the International Telemetering Conference (TTC), 2003, p. 1272.
301. D. V. Sarwate and M. B. Pursley, "Crosscorrelation Properties of Pseudorandom and Related Sequences," Proc. IEEE, vol. 68, no. 5, pp. 593-619, May 1980.
302. J. Savage, "Sequential Decoding - The Computational Problem," Bell Syst. Tech. Journal,ml.45,pp. 149-175, Jan. 1966.
303. C. Schlegel, Trellis Coding. New York: IEEE Press, 1997.
304. M. Schroeder, Number Theory in Science and Communication, 2nd ed. New York: Springer-Verlag, 1986.
305. R. Sedgewick, Algorithms. Reading, MA: Addison-Wesley, 1983.
306. J. Seghers, "On the Free Distance of TURBO Codes and Related Product Codes," Swiss Federal Institute of Technology, Zurich, Switzerland, Final Report, Diploma Project SS 1995 6613, Aug. 1995.
307. N. Seshadri and C.-E. W. Sundberg, "Multi-level Trellis Coded Modulation for the Rayleigh Fading Channel," IEEE Trans. Comm., vol. 41, pp. 1300-1310, Sept. 1993.
308. K. Shanmugan and P. Balaban, "A Modified Monte Carlo Simulation Technique for Evaluation of Error Rate in Digital Communication Systems," IEEE Trans. Comm., vol. 28, no. 11, pp. 1916-1924, Nov. 1980.
309. C. Shannon, "A Mathematical Theory of Communication," Bell Syst. Tech. Journal, vol. 27, pp. 623-656, 1948, (see also Collected Papers of Claude Shannon, IEEE Press, 1993).
310. M. Shao and C. L. Nikias, "An ML/MMSE Estimation Approach to Blind Equalization," in Proc. ICASSP, vol. 4. DEEE, 1994, pp. 569-572.
311. R. Y. Shao, S. Lin, and M. P. Fossorier, "Two simple stopping criteria for turbo decoding," IEEE Trans. Comm., vol. 47, no. 8, pp. 1117-1120, Aug. 1999.
312. R. Shao, M. Fossorier, and S.Lin, "Two Simple Stopping Criteria for Iterative Decoding," in Proc. IEEESymp. Info. Theory, Cambridge, MA, Aug. 1998, p. 279.
313. A. Shibutani, H. Suda, andF. Adachi, "Reducing Average Number of Turbo Decoding Iterations," Electron. Lett., vol. 35, no. 9, pp. 70-71, Apr. 1999.
314. R. Singleton, "Maximum Distance q-ary Codes," IEEE Trans. Information Theory, vol. 10, pp. 116-118, 1964.
315. B. Sklar, "A Primer on Turbo Code Concepts," IEEE Comm. Magazine, pp. 94-101, Dec. 1997.
316. P. Smith, M. Shafi, and H. Gao, "Quick Simulation: A Review of Importance Sampling Techniques in Communications Systems," IEEE Journal on Selected Areas in Communications, vol. 15, no. 4, pp. 597-13, May 1997.
317. J. Snyders, "Reduced Lists of Error Patterns for Maximum Likelihood Soft Decoding," IEEE Trans. Information Theory, vol. 37, pp. 1194-1200, July 1991.
318. J. Snyders and Y. Be'ery, "Maximum Likelihood Soft Decoding of Binary Block Codes and Decoders for the Golay Codes," IEEE Trans. Information Theory, vol. 35, pp. 963-975, Sept. 1989.
319. H. Song and B. V. Kumar, "Low-Density Parity-Check Codes For Partial Response Channels," IEEE Signal Processing Magazine, vol. 21, no. 1, pp. 56-66, Jan. 2004.
320. P. Staahl, J. B. Anderson, and R. Johannesson, "Optimal and Near-Optimal Encoders for Short and Moderate-Length Tail-Biting Trellises," IEEE Trans. Information Theory, vol. 45, no. 7, pp. 2562-2571, Nov. 1999.
321. H. Stichtenoth, Algebraic Function Fields and Codes. Berlin: Springer-Verlag, 1993.
322. G. Stuber, Principles of Mobile Communication, 2nd ed. Boston: Kluwer Academic Press, 2001.
323. M. Sudan, "Decoding of Reed-Solomon Codes Beyond the Error-Correction Bound," J. Complexity, vol. 13, pp. 180-193, 1997.
324. Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, "A Method for Solving Key Equation for Goppa Codes," Inf. and Control, vol. 27, pp. 87-99,1975.
325. C.-E. W. Sundberg and N. Seshadri, "Coded Modulation for Fading Channels: An Overview," European Trans. Telecommun. and Related Technoi, pp. 309-324, May 1993, special issue on Application of Coded Modulation Techniques.
326. A. Swindlehurst and G. Leus, "Blind and Semi-Blind Equalization for Generalized Space-Time Block Codes," IEEE Trans. Signal Processing, vol. 50, no. 10, pp. 2489-2498, Oct. 2002.
327. D. Taipale and M. Pursley, "An Improvement to Generalized-Minimum-Distance Decoding," IEEE Trans. Information Theory, vol. 37, pp. 167-172, Jan. 1991.
328. O. Takeshita and J. D.J. Costello, "New Classes of Algebraic Interleavers for Turbo-Codes," in Int. Conf. on Info. Theory (Abstracts), Cambridge, MA, Aug. 1998.
329. O. Takeshita and J. D.J. Costello, "New Deterministic Interleaver Designs for Turbo Codes," IEEE Trans. Information Theory, vol. 46, pp. 1988-2006, Sept. 2000.
330. R. Tanner, "A Recursive Approach To Low Complexity Codes," IEEE Trans. Info. Theory, vol. 27, no. 5, pp. 533-547, Sept. 1981.
331. V. Tarokh, H. Jararkhami, and A. Calderbank, "Space-Time Block Codes from Orthogonal Designs," IEEE Trans. Info. Theory, vol. 45, no. 5, pp. 1456-1467, July 1999.
332. V. Tarokh, N. Seshadri, and A. Calderbank, "Space-Time Codes for High Data Rate Wireless Communication: Performance Criterion and Code Construction," IEEE Trans. Info. Theory, vol. 44, no. 2, pp. 744-765, Mar. 1998.
333. E. Telatar, "Capacity of Multi-Antenna Gaussian Channels," AT&T Bell Labs Internal Tech. Memo, June 1995.
334. S. ten Brink, "Iterative Decoding Trajectories of Parallel Concatenated Codes," in Third IEEE TTG Conf. on Source and Channel Coding, Munich, Germany, Jan. 2000.
335. S. ten Brink, "Rate One-Half Code for Approaching the Shannon Limit by 0.1 dB," Electron. Lett., vol. 36, pp. 1293-1294, July 2000.
336. S. ten Brink, "Convergence Behavior of Iteratively Decoded Parallel Concatenated Codes," IEEE Trans. Comm., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
337. A. Tietavainen, "On the nonexistence of perfect codes over finite fields," SIAM J. Appl. Math., vol. 24, pp. 88-96,1973.
338. O. Tirkkonen and A. Hottinen, "Square-Matrix Embeddable Space-Time Block Codes for Communication: Performance Criterion and Code Construction," IEEE Trans. Information Theory, vol. 44, no. 2, pp. 744-765, Mar. 2002.
339. M.Tomlinson, "New Automatic Equalizer Employing Modulo Arithmetic," £/ecm?n. Lett, vol. 7,pp. 138-139,Mar. 1971.
340. M. Trott, S. Benedetto, R. Garello, andM. Mondin, "Rotational Invariance of Trellis Codes Part I: Encoders and Precoders," IEEE Trans. Information Theory, vol. 42, pp. 751-765, May 1996.
341. M. Tsfasman and S. Vladut, Algebraic-Geometric Codes. Dordrecht, The Netherlands: Kluwer Academic Publishers, 1991.
342. M. Tsfasman, S. Vladu, and T. Zink, "On Goppa Codes Which Are Better than the Varshamov-Gilbert Bound," Math. Nachr., vol. 109, pp. 21-28, 1982.
343. M. Tiichler, R. Koetter, and A. C. Singer, "Turbo Equalization: Principles and New Results," IEEE Trans. Comm., vol. 50, no. 5, pp. 754-767, May 2002.
344. G. Ungerbock and I. Csajka, "On Improving Data-Link Performance by Increasing Channel Alphabet and Introducing Sequence Coding," in IEEE Int. Symp. on Inform. Theory, Ronneby, Sweden, June 1976, p. 53.
345. G. Ungerboeck, "Channel Coding with Multilevel/Phase Signals," IEEE Trans. Info. Theory, vol. 28, no. 1, pp. 55-67, Jan. 1982.
346. G. Ungerboeck, "Trellis-Coded Modulation with Redundant Signal Sets. Part I: Introduction," IEEE Comm. Mag., vol. 25, no. 2, pp. 5-11, Feb. 1987.
347. G. Ungerboeck, "Trellis-Coded Modulation with Redundant Signal Sets. Part II: State of the Art," IEEE Comm. Mag., vol. 25, no. 2, pp. 12-21, Feb. 1987.
348. A. Valembois and M. Fossorier, "An Improved Method to Compute Lists of Binary Vectors that Optimize a Given Weight Function with Application to Soft Decision Decoding," IEEE Comm. Lett., vol. 5, pp. 456-458, Nov. 2001.
349. G. van der Geer and H. van Lint, Introduction to Coding Theory and Algebraic Geometry. Basel: Birkhauser, 1988.
350. J. van Lint, Introduction to Coding Theory, 2nd ed. Berlin: Springer-Verlag, 1992.
351. B. Vasic, "Structured Iteratively Decodable Codes based on Steiner Systems and their Application in Magnetic Recording," in Global Telecommunications Conference (GLOBECOM). San Antonio, TX: IEEE, Nov. 2001, pp. 2954-2960.
352. B. Vasic, E. Kurtas, and A. Kuznetsov, "LDPC Codes Based on Mutually Orthogonal Latin Rectangles and Their Application In Perpendicular Magnetic Recording," IEEE Trans. Magnetics, vol. 38, no. 5, pp. 2346-2348, Sept. 2002.
353. B. Vasic and O. Milenkovic, "Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding," IEEE Trans. Information Theory, vol. 50, no. 6, pp. 1156-1176, June 2004.
354. S. Verdu, "Optimum multi-user signal detection," Ph.D. dissertation. University of Illinois, 1984.
355. A. J. Viterbi, "Approaching the Shannon Limit: Theorist's Dream and Practitioner's Challenge," in Proc. of the Int. Conf. on Millimeter Wave and Far Infrared Science and Tech., 1996, pp. 1-11.
356. A. J. Viterbi, "An Intuitive Justification and Simplified Implementation of the MAP decoder for Convolutional Codes," IEEE J. Special Areas in Comm., pp. 260-264, Feb. 1997.
357. A. J. Viterbi and J. Omura, Principles of Digital Communication and Coding. New York: McGraw-Hill, 1979.
358. A. J. Viterbi, "Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm," IEEE Trans. Information Theory, vol. 13, pp. 260-269, Apr. 1967.
359. A. J. Viterbi, "Convolutional Codes and Their Performance in Communication Systems," IEEE Trans. Com. Techn., vol. 19, no. 5, pp. 75-772, Oct. 1971.
360. J. von zur Gathen and J. Gerhard, Modem Computer Algebra. Cambridge: Cambridge University Press, 1999.
361. L.-F. Wei, "Coded M-DPSK with Built-in Time Diversity for Fading Channels," IEEE Trans. Information Theory, vol. 39, pp. 1820-1839, Nov. 1993.
362. A. J. Viterbi, "Trellis-Coded Modulation with Multidimensional Constellations," IEEE Trans. Info. Theory, vol. 33, no. 4, pp. 483-501, July 1987.
363. L. Wei, "Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space 1:180 Degrees," IEEE Journal on Selected Areas in Communications, vol. 2, pp. 659-672, 1984.
364. L. Wei, "Rotationally Invariant Convolutional Channel Coding with Expanded Signal Space II: Nonlinear Codes," IEEE Journal on Selected Areas in Communications, vol. 2, pp. 672-686, 1984.
365. L. Wei, "Trellis-Coded Modulation with Multidimensional Constellations," IEEE Trans. Information Theory, vol. 33, pp. 483-501, 1987.
366. L. Wei, "Rotationally Invariant TrelUs-Coded Modulation with Multidimensional M-PSK," IEEE Journal on Selected Areas in Communications, vol. 7, no. 9, pp. 1281-1295, 1989.
367. Y. Weiss, "Correctness of Local Probability Propagation in Graphical Models with Loops," Neural Computation, vol. 12, pp. 1-11,2000.
368. Y. Weiss and W. T. Freeman, "Correctness of Belief Propagation in Gaussian Graphical Models of Arbitrary Topology," Neural Computation, vol. 13, pp. 2173-2200, 2001.
369. L. R. Welch and E. R. Berlekamp, "Error Correction for Algebraic Block Codes," U.S. Patent Number 4.633,470, Dec. 30, 1986.
370. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Linkoping University, 1996.
371. N. Wiberg, H.-A. Loeliger, and R. Kotter, "Codes and Iterative Decoding on General Graphs," Euro. Trans. Telecommun., vol. 6, pp. 513-525,1995.
372. S. Wicker and V. Bhargava, Reed Solomon Codes and Their Applications. New York: IEEE Press, 1994.
373. S. B. Wicker, Error Control Systems for Digital Communications and Storage. Englewood Cliffs, NJ: Prentice-Hall, 1995.
374. S. B. Wicker and S. Kim, Fundamentals of Codes, Graphs, and Iterative Decoding. Boston: Kluwer Academic, 2003.
375. R. J. Wilson, Introduction to Graph Theory. Essex, England: Longman Scientific, 1985.
376. S. Wilson and Y. Leung, "Trellis Coded Phase Modulation on Rayleigh Fading Channels," in Proc. IEEE ICC, June 1997.
377. J. K. Wolf, "Efficient Maximum Likelihood Decoding of Linear Block Codes Using a Trellis," IEEE Trans. Info. Theory, vol. 24, no. 1, pp. 76-80, Jan. 1978.
378. J. Wozencraft and B. Reiffen, Sequential Decoding. Cambridge, MA: MIT Press, 1961.
379. X.-W. Wu and P. Siegel, "Efficient Root-Finding Algorithm with Application to List Decoding of Algebraic-Geometric Codes," IEEE Trans. Information Theory, vol. 47, pp. 2579-2587, Sept. 2001.
380. Y. Wu, B. D. Woerner, and W. J. Ebel, "A simple stopping criterion for turbo decoding," IEEE Comm. Lett., vol. 4, no. 8, pp. 258-260, Aug. 2000.
381. J. Yeddida, W. Freeman, and Y. Weiss, "Generalized Belief Propagation," in Advances in Neural Information Processing Systems, T. Leen, T. Dietterich, and V. Tresp, Eds., 2000, vol. 13, pp. 689-695, fR-2000-26.
382. R. W. Yeung, A First Course in Information Theory. New York: Kluwer Academic, 2002.
383. E. Zehavi and J. Wolf, "On the Performance Evaluation of Trellis Codes," IEEE Trans. Information Theory, vol. 32, pp. 196-202, Mar. 1987.
384. F. Zhai and I. J. Fair, "New Error Detection Techniques and Stopping Criteria for Turbo Decoding," in IEEE Canadian Conference on Electronics and Computer Engineering (CCECE), 2000, pp. 58-60.
385. W. Zhang, "Finite-State Machines in Communications," Ph.D. dissertation, University of South Australia, 1995.
386. R. E. Ziemer and R. L. Peterson, Digital Communications and Spread Spectrum Systems. New York: Macmillan, 1985.
387. N. Zierler, "Linear Recurring Sequences," J. Soc. Indust. Appl. Math., vol. 7, pp. 31-48, 1959.
388. K. S. Zigangirov, "Some Sequential Decoding Procedures," Prob. Pederachi Inform., vol. 2, pp. 13-25, 1966.