Publication: Research - peer-review › Conference article – Annual report year: 2011
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.
|Journal||Lecture Notes in Computer Science|
|Workshop||3rd International Workshop on Coding and Cryptology|
|Period||30/05/11 → 03/06/11|
|Citations||Web of Science® Times Cited: No match on DOI|
- Euclidean and projective geometry, Graph codes
Loading map data...
No data available