Graph Codes with Reed-Solomon Component Codes

Tom Hoholdt, Jorn Justesen
2006 2006 IEEE International Symposium on Information Theory  
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. Authorized licensed use lim ited to: D anm arks T ekniske Inform ationscenter. D ownloa de d on N ove m be r 2 8 , 2 0 0 9 a t 1 6 :2 2 from IE E E X plore . R e strictions
more » ... e . R e strictions a pply.
doi:10.1109/isit.2006.261904 dblp:conf/isit/HoholdtJ06 fatcat:rlc6avzbjjgm5kzh6zc2apwbdi