The Minimum Distance of Graph Codes

Publication: Research - peer-reviewConference article – Annual report year: 2011

Documents

DOI

View graph of relations

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
Publication date2011
Volume6639
Pages201-212
ISSN0302-9743
DOIs
StatePublished

Workshop

Workshop3rd International Workshop on Coding and Cryptology
Number3
CountryChina
CityQingdao
Period30/05/1103/06/11
CitationsWeb of Science® Times Cited: No match on DOI

Keywords

  • Euclidean and projective geometry, Graph codes
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

Download statistics

No data available

ID: 5637414