Paper published in a book (Scientific congresses, symposiums and conference proceedings)
A Lower Bound for the Minimum Distance of Intersection Codes
Franck, Christian; Sorger, Ulrich
2010In A Lower Bound for the Minimum Distance of Intersection Codes
Peer reviewed
 

Files


Full Text
PaperBound.pdf
Author postprint (122.62 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Entrol Contol Coding
Abstract :
[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 :
Computer science
Identifiers :
UNILU:UL-CONFERENCE-2011-020
Author, co-author :
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)
External co-authors :
no
Language :
English
Title :
A Lower Bound for the Minimum Distance of Intersection Codes
Publication date :
2010
Event name :
6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2010
Event place :
Brest, France
Event date :
6-10 Sept. 2010
Main work title :
A Lower Bound for the Minimum Distance of Intersection Codes
ISBN/EAN :
978-1-4244-6744-0
Pages :
319 - 323
Peer reviewed :
Peer reviewed
Commentary :
Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on
Available on ORBilu :
since 29 January 2016

Statistics


Number of views
130 (16 by Unilu)
Number of downloads
4 (4 by Unilu)

Scopus citations®
 
0
Scopus citations®
without self-citations
0

Bibliography


Similar publications



Contact ORBilu