| Titel:
|
Graph Codes with Reed-Solomon Component Codes |
| Type:
|
Article in proceedingsArticle in proceedings |
| Person(er):
|
Technical University of Denmark
Email:
Technical University of Denmark
Email:
|
| Uddrag:
|
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. |
| Publiceret:
|
part of: ISIT 2006 (ISBN: 1-4244-0504-1), 2006, IEEE Press, Seattle, Washington, USA |
| DOI:
|
|
| Fil(er):
|
|
| Præsenteret ved:
|
2006IEEE International Symposium on Information Theory (ISIT), Seattle, WA |
|