The Minimum Distance of Graph Codes

Tom Høholdt; Jørn Justesen

doi:10.1007/978-3-642-20901-7_12

The Minimum Distance of Graph Codes

Tom Høholdt
, Jørn Justesen

Research output: Contribution to journal › Conference article › Research › peer-review

1324 Downloads (Orbit)

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.

Original language	English
Book series	Lecture Notes in Computer Science
Volume	6639
Pages (from-to)	201-212
ISSN	0302-9743
DOIs	https://doi.org/10.1007/978-3-642-20901-7_12
Publication status	Published - 2011
Event	3rd International Workshop on Coding and Cryptology - Qingdao, China Duration: 30 May 2011 → 3 Jun 2011 Conference number: 3

Workshop

Workshop	3rd International Workshop on Coding and Cryptology
Number	3
Country/Territory	China
City	Qingdao
Period	30/05/2011 → 03/06/2011

Keywords

Euclidean and projective geometry
Graph codes

Access to Document

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

IWCCpaper final[1]

OpenUrl availability

Full text

Cite this

@inproceedings{42cfa0c3e07b4b9198b00f05be829119,

title = "The Minimum Distance of Graph Codes",

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.",

keywords = "Euclidean and projective geometry, Graph codes",

author = "Tom H{\o}holdt and J{\o}rn Justesen",

year = "2011",

doi = "10.1007/978-3-642-20901-7\_12",

language = "English",

volume = "6639",

pages = "201--212",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "3rd International Workshop on Coding and Cryptology, IWCC 2011 ; Conference date: 30-05-2011 Through 03-06-2011",

}

TY - GEN

T1 - The Minimum Distance of Graph Codes

AU - Høholdt, Tom

AU - Justesen, Jørn

N1 - Conference code: 3

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

SN - 0302-9743

VL - 6639

SP - 201

EP - 212

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 3rd International Workshop on Coding and Cryptology

Y2 - 30 May 2011 through 3 June 2011

ER -

The Minimum Distance of Graph Codes

Abstract

Workshop

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this