Reference : A Lower Bound for the Minimum Distance of Intersection Codes
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/24037
A Lower Bound for the Minimum Distance of Intersection Codes
English
Franck, Christian mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Sorger, Ulrich mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
2010
A Lower Bound for the Minimum Distance of Intersection Codes
319 - 323
Yes
978-1-4244-6744-0
6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2010
6-10 Sept. 2010
Brest
France
[en] Entrol Contol Coding
[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.
http://hdl.handle.net/10993/24037
10.1109/ISTC.2010.5613889
Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
PaperBound.pdfAuthor postprint119.74 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.