Graph Codes with Reed-Solomon Component Codes

Tom Høholdt, Jørn Justesen

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

473 Downloads (Pure)

Abstract

We treat a specific case of codes based on bipartite expander graphs coming from finite geometries. The code symbols are associated with the branches and the symbols connected to a given node are restricted to be codewords in a Reed-Solomon code. We give results on the parameters of the codes and methods for their encoding.
Original languageEnglish
Title of host publicationISIT 2006 : 2006 IEEE International Symposium on Information Theory
Number of pages5
Place of PublicationSeattle, Washington, USA
PublisherIEEE Press
Publication date2006
ISBN (Print)1-4244-0504-1
DOIs
Publication statusPublished - 2006
Event2006 IEEE International Symposium on Information Theory - Seattle, WA, United States
Duration: 9 Jul 200614 Jul 2006
http://www.isit2006.org/

Conference

Conference2006 IEEE International Symposium on Information Theory
CountryUnited States
CitySeattle, WA
Period09/07/200614/07/2006
Internet address

Bibliographical note

Copyright: 2006 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE

Fingerprint Dive into the research topics of 'Graph Codes with Reed-Solomon Component Codes'. Together they form a unique fingerprint.

Cite this