Decoding of block codes

IEEE Transactions on Communications

Volumn 44, Issue 9, 1996, Pages 1052-1056

  Ekroot, Laura ^a   Dolinar, Sam ^a  

^a CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; HEURISTIC METHODS; ITERATIVE METHODS; MATRIX ALGEBRA; SPURIOUS SIGNAL NOISE;

BINARY ANTIPODAL SIGNALING; BINARY LINEAR BLOCK CODES; BINARY SYMBOLS; BINARY TREE; MAXIMUM LIKELIHOOD DECODING; SOFT DECISION DECODING;

BLOCK CODES;

EID: 0030247095     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.536908     Document Type: Article

References (13)

1. Y. S. Han C. R. P. Hartmann C.-C. Chen Efficient maximum-likelihood soft-decision decoding of linear block codes using algorithm ${\\rm{A}}^*$ Dec. 1991 School of Computer and Information Science, Syracuse University NY, Syracuse Tech. Rep. SU-CIS-91-42
2. Y. S. Han C. R. P. Hartmann C.-C. Chen Efficient priority-first search maximum-likelihood soft-decision decoding of linear block codes IEEE Trans. Inform. Theory 39 1514 1523 Sept. 1993 18 6560 259636
3. O. Collins Coding beyond the computational cutoff rate 1989 Ph.D. dissertation CA, Pasadena
4. T. H. Cormen C. E. Leiserson R. L. Rivest Introduction to Algorithms 1990 McGraw-Hill New York
5. R. J. McEliece The Viterbi decoding complexity of linear block codes IEEE ISIT`94 Norway, Trondheim 3149 8959 394677
6. T. Kasami T. Takata T. Fujiwara S. Lin On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes IEEE Trans. Inform. Theory 39 242 245 Jan. 1993 18 4498 179366
7. S. Dolinar L. Ekroot A. Kiely W. Lin R. J. McEliece The permutation trellis complexity of linear block codes Proc. 32nd Annual Allerton Conf. Commun., Control, Comput. Oct. 1994 Illinois, Allerton
8. G. C. Clark J. B. Cain Error-Correction Coding for Digital Communications 23 24 1981 Plenum New York
9. N. J. Nilsson Principles of Artificial Intelligence 1980 Tioga Publishing Co. CA, Palo Alto
10. Y. S. Han C. R. P. Hartmann Designing efficient maximum-likelihood soft-decision decoding algorithms for linear block codes using algorithm ${\\rm{A}}^*$ June 1992 School of Computer and Information Science, Syracuse University NY, Syracuse Tech. Rep. SU-CIS-92-10
11. L. Ekroot S. Dolinar Maximum-likelihood soft-decision decoding of block codes using the ${\\rm{A}}^*$ algorithm 129 144 15 May 1994 Jet Propulsion Laboratory CA, Pasadena TDA Progress Report 42-117 Jan.̵Mar. 1994
12. L. R. Bahl J. Cocke F. Jelinek J. Raviv Optimal decoding of linear codes for minimizing symbol error rate IEEE Trans. Inform. Theory IT-20 284 287 Mar. 1974
13. A. Kiely S. Dolinar R. McEliece L. Ekroot W. Lin Trellis decoding complexity of linear block codes IEEE Trans. Inform. Theory, special issue on Codes and Complexity Nov. 1996 18 12144 556665