[en] 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.
Disciplines :
Sciences informatiques
Identifiants :
UNILU:UL-CONFERENCE-2011-020
Auteur, co-auteur :
FRANCK, Christian ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
SORGER, Ulrich ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Co-auteurs externes :
no
Langue du document :
Anglais
Titre :
A Lower Bound for the Minimum Distance of Intersection Codes
Date de publication/diffusion :
2010
Nom de la manifestation :
6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2010
Lieu de la manifestation :
Brest, France
Date de la manifestation :
6-10 Sept. 2010
Titre de l'ouvrage principal :
A Lower Bound for the Minimum Distance of Intersection Codes
ISBN/EAN :
978-1-4244-6744-0
Pagination :
319 - 323
Peer reviewed :
Peer reviewed
Commentaire :
Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on
