Paper Info
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.
Year
DOI
Venue
2011
10.1007/978-3-642-20901-7_12
IWCC
Keywords
Field
DocType
minimum distance,graph code,component code,euclidean plane,code symbol,bipartite expander graph
Hamming code,Discrete mathematics,Combinatorics,Expander graph,Computer science,Low-density parity-check code,Block code,Bipartite graph,Expander code,Linear code,Reed–Muller code
Conference
Citations 
PageRank 
References 
2
0.43
9
Authors
2
Name
Order
Citations
PageRank
Tom Høholdt118628.53
Jørn Justesen28124.83