DocumentCode
2947830
Title
Graph Codes with Reed-Solomon Component Codes
Author
Hoholdt, Tom ; Justesen, Jorn
Author_Institution
Dept. of Math., Tech. Univ. Denmark, Lyngby
fYear
2006
fDate
9-14 July 2006
Firstpage
2022
Lastpage
2026
Abstract
We treat a specific case of codes based on bipartite expander graphs coming from finite geometries. The code symbols are associated with the branches and the symbols connected to a given node are restricted to be codewords in a Reed-Solomon code. We give results on the parameters of the codes and methods for their encoding
Keywords
Reed-Solomon codes; graph theory; Reed-Solomon component codes; bipartite expander graphs; codewords; graph codes; Bipartite graph; Concatenated codes; Eigenvalues and eigenfunctions; Encoding; Geometry; Graph theory; Iterative decoding; Joining processes; Mathematics; Reed-Solomon codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2006 IEEE International Symposium on
Conference_Location
Seattle, WA
Print_ISBN
1-4244-0505-X
Electronic_ISBN
1-4244-0504-1
Type
conf
DOI
10.1109/ISIT.2006.261904
Filename
4036323
Link To Document