On error floor and free distance of turbo codes

IEEE International Conference on Communications

Volumn 1, Issue , 2001, Pages 45-49

  Garello, Roberto ^a   Chiaraluce, Franco ^a   Pierleoni, Paola ^a   Scaloni, Marco ^a   Benedetto, Sergio ^b  

^a UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BIT ERROR RATE; CONSTRAINT THEORY; CONVOLUTIONAL CODES; ENCODING (SYMBOLS); ERROR ANALYSIS; ERROR DETECTION; SIGNAL TO NOISE RATIO;

CONSTRAINED SUBCODES; INTERLEAVERS;

TURBO CODES;

EID: 0034858405     PISSN: 05361486     EISSN: None     Source Type: Journal    
DOI: 10.1109/ICC.2001.936270     Document Type: Article

References (9)

1. Near shannon limit error-correcting coding and decoding: Turbo-codes
2. A distance spectrum interpretation of turbo codes
3. Punctured turbo-codes for BPSK/QPSK channels
4. The intractability of computing the minimum distance of a code
5. Computing the free distance of turbo codes and serially concatenated convolutional codes: Algorithms and applications
6. A method for determining the distance profile of turbo codes
7. A search for good convolutional codes to be used in the construction of turbo codes
8. Variance of the turbo-code performance bound over the interleavers