On cycle-based permutor designs for serially concatenated convolutional codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2003, Pages 279-

  Huebner, Axel ^a   Truhachev, Dmitri ^b   Zigangirov, Kamil Sh ^b  

^a UNIVERSITY OF ULM   (Germany)

^b LUND UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; BOUNDARY CONDITIONS; COMPUTER SIMULATION; ERROR CORRECTION; ITERATIVE METHODS; MATRIX ALGEBRA; SIGNAL ENCODING; THEOREM PROVING;

LOW DENSITY PARITY CHECK; PERMUTATION MATRIX;

CONVOLUTIONAL CODES;

EID: 0141938894     PISSN: 21578096     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/isit.2003.1228294     Document Type: Conference Paper

References (3)

1. D. V. Truhachev, M. Lentmaier, and K. Sh. Zigangirov, "Some results concerning design and decoding of turbo-codes," Probl. of Inform. Transm., vol. 37, no. 3, pp. 190-205, 2001.
2. R.G. Gallager, Low Density Parity-Check Codes. Cambridge, Massachusetts: M.I.T. Press, 1963.
3. S. Höst, R. Johannesson, K.Sh. Zigangirov, and V. V. Zyablov, "Active distances for convolutional codes," IEEE Trans. on Inform. Theory, vol. IT-45, pp. 658-669, March 1999.