DocumentCode
2050206
Title
On nearly-MDS expander codes
Author
Roth, Ron M. ; Skachek, Vitaly
Author_Institution
Comput. Sci. Dept., Technion, Haifa, Israel
fYear
2004
fDate
27 June-2 July 2004
Firstpage
8
Abstract
A construction of graph codes is presented that approaches the singleton bound as the alphabet size goes to infinity. These codes can be decoded by a combined error-erasure decoder whose time complexity grows linearly with the code length.
Keywords
concatenated codes; linear codes; MDS expander code; error-erasure decoder; graph code construction; singleton bound; Computer errors; Computer science; Concatenated codes; Eigenvalues and eigenfunctions; Galois fields; Graph theory; H infinity control; Iterative algorithms; Iterative decoding; Linear code;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365043
Filename
1365043
Link To Document