## The Minimum Distance of Graph Codes

Publication: Research - peer-review › Conference article – Annual report year: 2011

### Standard

**The Minimum Distance of Graph Codes.** / Høholdt, Tom; Justesen, Jørn.

Publication: Research - peer-review › Conference article – Annual report year: 2011

### Harvard

*Lecture Notes in Computer Science*, vol 6639, pp. 201-212., 10.1007/978-3-642-20901-7_12

### APA

*Lecture Notes in Computer Science*,

*6639*, 201-212. 10.1007/978-3-642-20901-7_12

### CBE

### MLA

*Lecture Notes in Computer Science*. 2011, 6639. 201-212. Available: 10.1007/978-3-642-20901-7_12

### Vancouver

### Author

### Bibtex

}

### RIS

TY - CONF

T1 - The Minimum Distance of Graph Codes

AU - Høholdt,Tom

AU - Justesen,Jørn

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Euclidean and projective geometry

KW - Graph codes

U2 - 10.1007/978-3-642-20901-7_12

DO - 10.1007/978-3-642-20901-7_12

M3 - Conference article

VL - 6639

SP - 201

EP - 212

JO - Lecture Notes in Computer Science

T2 - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -