The Minimum Distance of Graph Codes
We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other geometries. We give results on the minimum distances of the codes.
KeywordsGraph codes Euclidean and projective geometry
Unable to display preview. Download preview PDF.