The Minimum Distance of Graph Codes

  • Tom Høholdt
  • Jørn Justesen
Conference paper

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

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6639)
Cite this paper as:
Høholdt T., Justesen J. (2011) The Minimum Distance of Graph Codes. In: Chee Y.M. et al. (eds) Coding and Cryptology. IWCC 2011. Lecture Notes in Computer Science, vol 6639. Springer, Berlin, Heidelberg

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Tom Høholdt
    • 1
  • Jørn Justesen
    • 1
  1. 1.Department of MathematicsThe Technical University of DenmarkLyngbyDenmark

Personalised recommendations