The Minimum Distance of Graph Codes

Tom Høholdt, Jørn Justesen

Research output: Contribution to journalConference articleResearchpeer-review

594 Downloads (Pure)

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 languageEnglish
Book seriesLecture Notes in Computer Science
Volume6639
Pages (from-to)201-212
ISSN0302-9743
DOIs
Publication statusPublished - 2011
Event3rd International Workshop on Coding and Cryptology - Qingdao, China
Duration: 30 May 20113 Jun 2011
Conference number: 3

Workshop

Workshop3rd International Workshop on Coding and Cryptology
Number3
CountryChina
CityQingdao
Period30/05/201103/06/2011

Keywords

  • Euclidean and projective geometry
  • Graph codes

Fingerprint Dive into the research topics of 'The Minimum Distance of Graph Codes'. Together they form a unique fingerprint.

Cite this