A Lower Bound for the Minimum Distance of Intersection Codes

Reference : A Lower Bound for the Minimum Distance of Intersection Codes


	Document type :	Scientific congresses, symposiums and conference proceedings : Paper published in a book
	Discipline(s) :	Engineering, computing & technology : Computer science
	To cite this reference:	http://hdl.handle.net/10993/24037

Title :	A Lower Bound for the Minimum Distance of Intersection Codes
Language :	English
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) >]
Publication date :	2010
Main document title :	A Lower Bound for the Minimum Distance of Intersection Codes
Pages :	319 - 323
Peer reviewed :	Yes
ISBN :	978-1-4244-6744-0
Event name :	6th International Symposium on Turbo Codes and Iterative Information Processing (ISTC), 2010
Event date :	6-10 Sept. 2010
Event place (city) :	Brest
Event country :	France
Keywords :	[en] 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.
Permalink :	http://hdl.handle.net/10993/24037
DOI :	10.1109/ISTC.2010.5613889
Commentary :	Turbo Codes and Iterative Information Processing (ISTC), 2010 6th International Symposium on

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Limited access	PaperBound.pdf		Author postprint	119.74 kB	Request a copy

All documents in ORBi^lu are protected by a user license.