A symbol-by-symbol MAP decoding rule for linear codes over rings using the dual code

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 1998, Pages 90-

  Berkmann, J ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CODING SCHEME; DUAL CODES; HIGH RATE; INTEGER RING; LINEAR CODES OVER RINGS; LOWER COMPLEXITY; MAP DECODING; MAXIMUM A POSTERIORI DECODING;

CONVOLUTIONAL CODES; INFORMATION THEORY;

ITERATIVE DECODING;

EID: 0005112095     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.1998.708676     Document Type: Conference Paper

References (6)

1. J, L, Massey and T. Mittolhokor, "Couvolutioiial codes over ringg", in Proc. Fourth Joint Swedish-Soviet int. Workshop on Information Theory-, Aug. 2T-Sept. 1, pp. 14-18, 1980, Gotland, Sweden.
2. J. Hagenauer, E. Offer and L. Papke, "Iterative decoding of binary block and convolution codes," IEEE Trans, on Information Theory, vol. 42, no.2, pp. 429-445, March 1996.
3. C. R. Hartmann, and L. D. Rudolph, "An optimum symbol-by-symbol decoding rule for linear codes", IEEE Trans. Inform. Theory, vol. IT-22, pp. 514-517, Sept. 1976.
4. G. Battail, M. C. Decouvelaere and P. Godlewski, "Replication decoding", IEEE Trans. Inform. Theory, vol. IT-2S, pp. 332-345, May 1979.
5. S. Riedel, "New symbol-by-symbol MAP decoding algorithms for high-rate convolutional codes which use reciprocal dual codes," IEEE Journal on Selected Areas in Communications, vol. JSAC-16, pp.175-185, Jan. 1998.
6. L. R. Bahl, J. Cocke, P. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.