Graph codes with Reed-Solomon component codes
T Hoholdt, J Justesen - 2006 IEEE International Symposium on …, 2006 - ieeexplore.ieee.org
T Hoholdt, J Justesen
2006 IEEE International Symposium on Information Theory, 2006•ieeexplore.ieee.orgWe 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
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
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
ieeexplore.ieee.org
Showing the best result for this search. See all results