A recursive approach to low complexity codes

IEEE Transactions on Information Theory - Tập 27 Số 5 - Trang 533-547 - 1981
R.M. Tanner1
1Board of Computer and Information Sciences, University of California, Santa Cruz, CA, USA

Tóm tắt

Từ khóa


Tài liệu tham khảo

10.1017/CBO9781107325425

10.1007/978-3-642-62012-6

10.1147/rd.45.0497

10.1109/TC.1980.1675585

10.1109/TIT.1979.1056035

zyablov, 1975, Estimation of the error-correction complexity of Gallager low-density codes, Probl Peredach Inform, 11, 23

berlekamp, 1968, Algebraic Coding Theory

forney, 1966, Concatenated Codes

10.1109/TIT.1970.1054477

10.1109/TIT.1976.1055582

10.1109/TIT.1970.1054504

gallager, 1963, Low-Density Parity-Check Codes, 10.7551/mitpress/4347.001.0001

aho, 1974, The Design and Analysis of Computer Algorithms

10.1109/TIT.1954.1057464

macwilliams, 1977, The Theory of Error-Correcting Codes

peterson, 1972, Error-Correcting Codes