A Recursive Approach to Low Complexity Codes

IEEE Transactions on Information Theory

Volumn 27, Issue 5, 1981, Pages 533-547

  Tanner, R Michael ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CODES, SYMBOLIC;

EID: 0019608335     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1981.1056404     Document Type: Article

References (16)

1. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. New York: North-Holland, 1977.
2. P. Elias, “Error-free coding” IRE Trans. Inform. Theory, vol. PGIT-4, pp. 29–37, Sept. 1954.
3. W. C. Gore, “Further results on product codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 446–451, July 1970.
4. G. D. Forney, Concatenated Codes. Cambridge: MIT Press, Res. Monograph 37, 1966.
5. S. M. Reddy, “On decoding iterated codes,” IEEE Trans. Inform. Theory, vol. IT-16, pp. 624–627, Sept. 1970.
6. E. M. Kasahara, Y. Sugiyama, S. Hirasawa, and T. Namekawa, “New classes of binary codes constructed on the basis of concatenated codes and product codes,” IEEE Trans. Inform. Theory, vol. IT-22, pp. 462–468, July 1976.
7. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
8. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
9. W. W. Peterson and E. J. Weldon, Jr., Error-Correcting Codes. Cambridge, MA: MIT Press, 1972.
10. P. J. Cameron and J. H. Van Lint, Graph Theory, Coding Theory, and Block Designs Cambridge: Univ. Press, 1975.
11. P. Dembowski, Finite Geometries. New York: Springer, 1968.
12. A. J. Hoffman and R. R. Singleton, “On Moore graphs with diameters 2 and 3,” IBM J. Res. Dev., vol. 4, pp. 497–504, Nov. 1960.
13. Y. Wallach and V. Konrad, “On block-parallel methods for solving linear equations,” IEEE Trans. Comput., vol. C-29, pp. 354–359, May 1980.
14. G. Battail, M. C. Decouvelaere, and P. Godlewski, “Replication decoding,” IEEE Trans. Inform Theory, vol. IT-25, pp. 332–345, May 1979.
15. V. V. Zyablov and M. S. Pinsker, “Estimation of the error-correction complexity of Gallager low-density codes,” Probl. Peredach. Inform., vol. 11, pp. 23–36, Jan. 1975.
16. E. Berlekamp, AIgebraic Coding Theory. New York: McGraw-Hill, 1968.