Graph Codes with Reed-Solomon Component Codes

@article{Hoholdt2006GraphCW,
  title={Graph Codes with Reed-Solomon Component Codes},
  author={T. Hoholdt and Jorn Justesen},
  journal={2006 IEEE International Symposium on Information Theory},
  year={2006},
  pages={2022-2026}
}
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