Download (direct link):
[Hsia] M. Y. Hsiao, “A Class of Optimal Minimum Odd-Weight-Column SEC-DED Codes,” IBM J. Res. and Dev., vol. 14, July 1970.
[IH] H. Imai and S. Hirakawa, “A New Multilevel Coding Method Using Error-Correcting Codes,” IEEE Trans. Info. Theory, vol. IT-23, no. 3, pp. 371-377, May 1977.
[IFMLI] M. Isaka, M. P. C. Fossorier, R. H. Morelos-Zaragoza, S. Lin and H. Imai, “Multilevel Coded Modulation for Unequal Error Protection and Multistage Decoding. Part II: Asymmetric Constellations,” IEEE Trans. Comm., vol. 48, no. 5, pp. 774-784, May 2000.
[ISTC1] Proceedings of the International Symposium on Turbo Codes and Related Topics, Brest, France, September 3-5, 1997.
[ISTC2] Proceedings of the Second International Symposium on Turbo Codes and Related Topics, Brest, France, September 4-7, 2000.
[ITCG] Special Issue on Codes and Graphs and Iterative Decoding Algorithms, IEEE Trans. Info. Theory, vol. 47, no. 2, Feb. 2001.
[Jer] M. C. Jeruchim, P. Balaban and K. S. Shanmugan, Simulation of Communication Systems, Plenum Press, 1992.
[Joh] R. Johannesson and K. S. Zigangirov, Fundamentals of Convolutional Coding, IEEE Press, 1999.
[JSAC1] Special Issue on the turbo principle: from theory to practice. Part I, IEEE J. Sel. Areas in Comm., vol. 19, no. 5, May 2001.
[JSAC2] Special Issue on the turbo principle: from theory to practice. Part II, IEEE J. Sel. Areas in Comm., vol. 19, no. 9, Sept. 2001.
[Kam] N. Kamiya, “On Algebraic Soft-Decision Decoding Algorithms for BCH Codes,” IEEE Trans. Info. Theory, vol. 47, no. 1, pp. 45-58, Jan. 2001.
[KNIH] T. Kaneko, T. Nishijima, H. Inazumi and S. Hirasawa, “An Efficient Maximum-Likelihood Decoding Algorithm for Linear Block Codes with Algebraic Decoder,” IEEE Trans. Info. Theory, vol. 40, no. 2, pp. 320-327, Mar. 1994.
[Kasl] M. Kasahara, Y. Sugiyama, S. Hirasawa and T. Namekawa, “A New Class of Binary Codes Constructed on the Basis of BCH Codes,” IEEE Trans. Info. Theory, vol. IT-21, pp. 582-585, 1975.
[Kas2] M. Kasahara, Y. Sugiyama, S. Hirasawa and T. Namekawa, “New Classes of Binary Codes Constructed on the Basis of Concatenated and Product Codes,” IEEE Trans. Info. Theory, vol. IT-22, no. 4, pp. 462-468, July 1976.
[Kasm] T. Kasami, “A Decoding Procedure for Multiple-Error-Correcting Cyclic Codes,” IEEE Trans. Info. Theory, vol. IT-10, pp. 134-138, 1964.
[KLP] T. Kasami, S. Lin and W. W. Peterson, “Polynomial Codes,” IEEE Trans. Info. Theory, vol. IT-14, no. 6, pp. 807-814, Nov. 1968.
[KKTFL] T. Kasami, T. Koumoto, T. Takata, T. Fujiwara and S. Lin, “The Least Stringent Sufficient Condition on the Optimality of Suboptimally Decoded Codewords,” Proc. 1995 IEEE Int. Symp. Info. Theory (ISIT'95), p. 470, Whistler, Canada, 1995.
[Kaz] P. Kazakov, “Fast Calculation of the Number of Minimum-Weight Words of CRC Codes,” IEEE Trans. Info. Theory, vol. 47, no. 3, pp. 1190-1195, March 2001.
[KLF] Y. Kuo, S. Lin and M. P. C. 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.
[KFL] R. 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.
[KV] R. Koetter and A. Vardy, “Algebraic Soft-Decision Decoding of Reed-Somon Codes,” Proc. 2000 IEEE Int. Symp. Info. Theory (ISIT’00), p. 61, Sorrento, Italy, June 25-30, 2000.
[Lee] L. H. C. Lee, Convolutional Coding: Fundamentals and Applications, Artech House,
[LGB] S. Le Goff, A. Glavieux and C. Berrou, “Turbo-Codes and High-Spectral Efficiency Modulation,” Proc. 1994 IEEE Int. Conf. Comm. (ICC’94), pp. 645-649, 1994.
[LC] S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, Prentice-Hall, 1983.
[LKFF] S. Lin, T. Kasami, T. Fujiwara and M. Fossorier, Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes, Kluwer Academic Press, 1998.
[LYHH] J. Lodge, R. Young, P. Hoeher and J. Hagenauer, “Separable MAP ‘Filters’ for the Decoding of Product and Concatenated Codes,” Proc. 1993 IEEE Int. Conf. Comm. (ICC’93), pp. 1740-1745, May 1993.
[Mac] D. J. C. MacKay, “Good Error-Correcting Codes Based on Very Sparse Matrices,” IEEE Trans. Info. Theory, vol. 45, no. 2, pp. 399-432, Mar. 1999.
[MN] D. J. C. MacKay and R. M. Neal, “Near Shannon Limit Performance of Low Density Parity Check Codes,” Electronics Letters, vol. 32, pp. 1645-1646, 1996.
[MS] F. J. Mac Williams and N. J. A. Sloane, The Theory of Error Correcting Codes, North-Holland, 1977.
[Man] D. Mandelbaum, “Decoding Beyond the Designed Distance of Certain Algebraic Codes,” Info, and Control, vol. 35, pp. 209-228, 1977.
[MT] P. A. Martin and D. P. Taylor, “On Adaptive Reduced-Complexity Iterative Decoding,” Proc. 2000 IEEE Global Telecomm. Conf. (GLOBECOM’OO), pp. 772 -776, 2000.
[Masl] J. L. Massey, Threshold Decoding, MIT Press, 1963.
[Mas2] J.L. Massey, “Shift Register Synthesis and BCH Decoding,” IEEE Trans. Info. Theory, vol. IT-15, no. 1, pp. 122-127, Jan. 1969.