The Minimum Distance of Graph Codes
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.
| Original language | English |
|---|---|
| Book series | Lecture Notes in Computer Science |
| Publication date | 2011 |
| Volume | 6639 |
| Pages | 201-212 |
| ISSN | 0302-9743 |
| DOIs | |
| State | Published |
Workshop
| Workshop | 3rd International Workshop on Coding and Cryptology |
|---|---|
| Number | 3 |
| Country | China |
| City | Qingdao |
| Period | 30-05-11 → 03-06-11 |
| Citations | Web of Science® Times Cited: No match on DOI |
|---|
Keywords
- Euclidean and projective geometry, Graph codes
Loading map data...
Download statistics
No data available
ID: 5637414