The minimum distance of graph codes

Authors:
Tom Høholdt;Jørn Justesen
Affiliations:
Department of Mathematics, The Technical University of Denmark, Lyngby, Denmark;Department of Mathematics, The Technical University of Denmark, Lyngby, Denmark
Venue:
IWCC'11 Proceedings of the Third international conference on Coding and cryptology
Year:
2011

Citing 7
Cited 0

The Mathematical Theory of Coding

The Mathematical Theory of Coding
Introduction to Coding Theory

Introduction to Coding Theory
Expander codes

IEEE Transactions on Information Theory - Part 1
Minimum-distance bounds by graph analysis

IEEE Transactions on Information Theory
On expander codes

IEEE Transactions on Information Theory
Error exponents of expander codes

IEEE Transactions on Information Theory
Improved Nearly-MDS Expander Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.