Title :
Multilevel expander codes
Author :
Barg, Alexander ; Zemor, Gilles
Author_Institution :
Dept. of ECE, Maryland Univ., College Park, MD
Abstract :
We define multilevel codes on bipartite graphs which have properties analogous to multilevel serial concatenations. A linear-time decoding algorithm is described that corrects a proportion of errors equal to half the Blokh-Zyablov bound. The error probability of this algorithm has exponent similar to that of serially concatenated multilevel codes, i.e. equals the best-known exponent achievable by a polynomial-time decoding algorithm
Keywords :
computational complexity; concatenated codes; error statistics; graph theory; iterative decoding; linear codes; bipartite graphs; error probability; linear-time decoding; multilevel expander codes; multilevel serial concatenations; polynomial-time decoding algorithm; Bipartite graph; Concatenated codes; Educational institutions; Error correction; Error correction codes; Error probability; Graph theory; Iterative algorithms; Iterative decoding; Linear code;
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location :
Adelaide, SA
Print_ISBN :
0-7803-9151-9
DOI :
10.1109/ISIT.2005.1523555
