BCJR trellis construction for binary linear block codes

IEE Proceedings: Communications

Volumn 144, Issue 6, 1998, Pages 367-371

  Manoukian, H H ^a   Honary, B ^a  

^a LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Cryptography; Equivalent codes; Linear block codes; Permutation; Trellis decoding

Indexed keywords

ALGORITHMS; BINARY CODES; BLOCK CODES; COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DECODING; HEURISTIC METHODS; MATRIX ALGEBRA;

BINARY LINEAR BLOCK CODES; MINIMAL WEIGHT GENERATOR MATRIX (MWGM);

TRELLIS CODES;

EID: 0031358691     PISSN: 13502425     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-com:19971611     Document Type: Article

References (17)

1. BAHL, L.R., COCKE, J., JELINEK, F., and RAVIV, J.: 'Optimal decoding of linear block codes for minimising symbol error rate', IEEE Trans.. 1974, IT-20, pp. 284-287
2. WOLF, J.K.: 'Efficient maximum likelihood of linear block codes using a trellis', IEEE Trans., 1978, IT-24, pp. 76-80
3. MASSEY, J.L.: 'Foundation and methods of channel encoding'. Proceedings of the international conference on Information theory and systems, Berlin, NTG-Fachberichte, 1978
4. FORNEY, G.D.: 'Coset codes: Part II: Binary lattices and related codes', IEEE Trans., 1988, IT-34, pp. 1152-1187
5. MÜDER, D.J.: 'Minimal trellises for block codes', IEEE Trans., 1988, FT-34, (5), pp. 1049-1053
6. MCELIECE, R.J.: 'On the BCJR trellis for linear block codes', IEEE Trans., 1996, FT-42, (4), pp. 1072-1092
7. SIDORENKO, V., MARKARIAN, G., and HONARY, B.: 'Minimal trellis design for linear codes based on the Shannon product', IEEE Trans., 1996, IT-C, (6), Part 1, pp. 2048-2053
8. HONARY, B., and MARKARIAN, G.: Trellis decoding of block codes. A practical approach' (Kluwer Academic Publishers, Boston, Dordrecht, London, 1997)
9. ZYABLOV, V.V., and SIDORENKO, V.K.: 'Bounds on complexity of trellis decoding of linear block codes', Probl. Peredachi Informais!!, 1993, 29, pp. 3-9 (in Russian),
10. HORN, G.B., and KSCHISCHANG, F.R.: 'A heuristic for ordering a linear block code to minimize trellis state complexity'. Proceedings of 32nd Allerton conference on Communications, control, and computing, 1994
11. ENGELHART, A., BOSSERT, M., MAUCHER, J., and SIDORENKO, V.: 'Heuristic algorithms for ordering a linear block code to reduce the number of nodes of the minimal trellis,', IEEE Trans. Inf. Theory, (Submitted to)
12. DOLINAR, S., EKROOT, L., KIELY, A., LIN, W., and MCELIECE, R.J.: 'Trellis complexity of linear block codes'. Proceedings of 32nd Allerton conference on Communications, control, and computing, 1994
13. AGUADO-BAYON, L.E., and FARRELL, P.O.: 'Reducing the complexity of trellises for block codes'. IEEE international symposium on Information theory, ISIT'95, Whistler, BC, Canada, 1995, pp. 347
14. KSCHISCHANG, F.R.: Private comunication, 1996
15. GAREY, M.R., and JOHNSON, D.S.: 'Computers and intractability: a guide to the theory of NP-completeness' (W.H. Freeman and Company, New York, 1979)
16. MCELIECE, R.J.: 'The Viterbi decoding complexity of linear block codes'. IEEE international symposium on Information theory, Trondheim, Norway, 1994
17. FORNEY, G.D., and TROTT, M.D.: The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders', IEEE Trans., 1993, IT-39, (5), pp. 1491-1523