The minimum distance of turbo-like codes

IEEE Transactions on Information Theory

Volumn 55, Issue 1, 2009, Pages 6-15

  Bazzi, Louay ^a   Mahdian, Mohammad ^b   Spielman, Daniel A ^a  

^a AMERICAN UNIVERSITY OF BEIRUT   (Lebanon)

^b Yale University   (United States)

Author keywords

Asymptotic growth; Concatenated codes; Minimum distance; Repeat accumulate accumulate (RAA) codes; Turbo codes

Indexed keywords

ASYMPTOTIC ANALYSIS; CONVOLUTION; CONVOLUTIONAL CODES; FINITE AUTOMATA; GROWTH (MATERIALS);

ACCUMULATE CODES; ASYMPTOTIC GROWTH; CONCATENATED CODES; CONVOLUTIONAL ENCODERS; MINIMUM DISTANCE; RANDOM PERMUTATIONS; REPEAT-ACCUMULATE-ACCUMULATE (RAA) CODES; REPETITION CODES; SERIALLY CONCATENATED CODES; SERIALLY CONCATENATED CONVOLUTIONAL CODES; SUBLINEAR; UPPER BOUNDS;

TURBO CODES;

EID: 58249138725     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2008.2008114     Document Type: Article

References (9)

1. M. Ajtai, "Determinism verus nondeterminism for linear time RAMs with memory restrictions," J. Comput. Syst. Sci., vol. 65, no. 1, pp. 2-37, 2002.
2. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 909-926, 1998.
3. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo codes," in Proc. IEEE Int. Conf. Commun. (ICC-1993), 1993, pp. 1064-1070.
4. M. Breiling, "A logarithmic upper bound on the minimum distance of turbo codes," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1692-1710, 2004.
5. D. Divsalar, H. Jin, and R. J. McEliece, "Coding theorems for "turbolike" codes," in Proc. 36th Annu. Allerton Conf. Commun., Contr., Comput., Monticello, IL, USA, Sep. 1998, pp. 201-210.
6. H. Jin and R. J. McEliece, "RA codes achieve AWGN channel capacity. In Marc," in AAECC, P. C. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. Berlin, Germany: Springer, 1999, vol. 1719, Lecture Notes in Computer Science, pp. 10-18.
7. N. Kahale and R. Urbanke, "On the minimum distance of parallel and serially concatenated codes," in Proc. IEEE Int. Symp. Inf. Theory Cambridge, MA, Aug. 1998, p. 31.
8. H. D. Pfister and P. H. Siegel, "The serial concatenation of rate-1 codes through uniform random interleavers," IEEE Trans. Inf. Theory vol. 49, no. 6, pp. 1425-1438, 2003.
9. B. Vucetic and J. S. Yuan, Turbo Codes: Principles and Applications New York: Kluwer Academic, 2000.