Title :
A lower bound for the minimum distance of intersection codes
Author :
Franck, Christian ; Sorger, Uli
Author_Institution :
Univ. of Luxembourg, Luxembourg, France
Abstract :
Intersection codes are a superclass of Turbo- and LDPC codes. This class contains codes constructed by intersecting interleaved constituent codes. We propose a lower bound for the minimum distance of these codes. Using this bound, we compare intersection codes obtained from different constituent codes.
Keywords :
parity check codes; turbo codes; LDPC codes; Turbo codes; constituent codes; interleaved constituent codes; intersection codes; minimum distance; Continuous wavelet transforms;
Conference_Titel :
Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on
Conference_Location :
Brest
Print_ISBN :
978-1-4244-6744-0
Electronic_ISBN :
978-1-4244-6745-7
DOI :
10.1109/ISTC.2010.5613889
