Chapter

Coding and Cryptology

Volume 6639 of the series Lecture Notes in Computer Science pp 201-212

The Minimum Distance of Graph Codes

  • Tom HøholdtAffiliated withDepartment of Mathematics, The Technical University of Denmark
  • , Jørn JustesenAffiliated withDepartment of Mathematics, The Technical University of Denmark

* Final gross prices may vary according to local VAT.

Get Access

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

Graph codes Euclidean and projective geometry