Title :
Minimum distance bounds for expander codes
Author_Institution :
Claude Shannon Inst., Univ. Coll. Dublin, Dublin
fDate :
Jan. 27 2008-Feb. 1 2008
Abstract :
Several expander code constructions and their parameters are surveyed. New generalized expander codes are introduced and their properties are compared with the properties of the existing constructions. Finally, some possible directions to extend the current research on expander codes are discussed.
Keywords :
encoding; expander codes; minimum distance bounds; Binary codes; Concatenated codes; Educational institutions; Entropy; Error correction; Graph theory; Hamming distance; Iterative decoding; Parity check codes; Vectors;
Conference_Titel :
Information Theory and Applications Workshop, 2008
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4244-2670-6
DOI :
10.1109/ITA.2008.4601075
