Graph Codes with Reed-Solomon Component Codes

Tom Høholdt

2006 · 21 citations · 6 references

DOIFull text

Open access

Concepts

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

References

6