DocumentCode
2271357
Title
Multilevel expander codes
Author
Barg, Alexander ; Zemor, Gilles
Author_Institution
Dept. of ECE, Maryland Univ., College Park, MD
fYear
2005
fDate
4-9 Sept. 2005
Firstpage
1315
Lastpage
1319
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;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Conference_Location
Adelaide, SA
Print_ISBN
0-7803-9151-9
Type
conf
DOI
10.1109/ISIT.2005.1523555
Filename
1523555
Link To Document