Conference paper · Book chapter
The Minimum Distance of Graph Codes
In
Lecture Notes in Computer Science
—
2011, Volume 6639, pp. 201-212
Abstract
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.
| Language: | English |
|---|---|
| Publisher: | Springer Berlin Heidelberg |
| Year: | 2011 |
| Pages: | 201-212 |
| Proceedings: | 3rd International Workshop on Coding and Cryptology |
| ISBN: | 3642209009 , 3642209017 , 9783642209000 and 9783642209017 |
| ISSN: | 16113349 and 03029743 |
| Types: | Conference paper and Book chapter |
| DOI: | 10.1007/978-3-642-20901-7_12 |
