Graph Codes with Reed-Solomon Component Codes

Tom Høholdt; Jørn Justesen

doi:10.1109/ISIT.2006.261904

Graph Codes with Reed-Solomon Component Codes

Tom Høholdt
, Jørn Justesen

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

1075 Downloads (Orbit)

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 language	English
Title of host publication	ISIT 2006 : 2006 IEEE International Symposium on Information Theory
Number of pages	5
Place of Publication	Seattle, Washington, USA
Publisher	IEEE Press
Publication date	2006
ISBN (Print)	1-4244-0504-1
DOIs	https://doi.org/10.1109/ISIT.2006.261904
Publication status	Published - 2006
Event	2006 IEEE International Symposium on Information Theory - Seattle, United States Duration: 9 Jul 2006 → 14 Jul 2006 http://www.isit2006.org/

Conference

Conference	2006 IEEE International Symposium on Information Theory
Country/Territory	United States
City	Seattle
Period	09/07/2006 → 14/07/2006
Internet address	http://www.isit2006.org/

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

Access to Document

10.1109/ISIT.2006.261904

H holdtFinal published version, 127 KB

OpenUrl availability

Check availability in DTU Findit

Cite this

@inproceedings{86f837574e364e7f9e272e864a96fa79,

title = "Graph Codes with Reed-Solomon Component Codes",

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.",

author = "Tom H{\o}holdt and J{\o}rn Justesen",

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; 2006 IEEE International Symposium on Information Theory, ISIT 2006 ; Conference date: 09-07-2006 Through 14-07-2006",

year = "2006",

doi = "10.1109/ISIT.2006.261904",

language = "English",

isbn = "1-4244-0504-1",

booktitle = "ISIT 2006",

publisher = "IEEE Press",

url = "http://www.isit2006.org/",

}

TY - GEN

T1 - Graph Codes with Reed-Solomon Component Codes

AU - Høholdt, Tom

AU - Justesen, Jørn

N1 - 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

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

U2 - 10.1109/ISIT.2006.261904

DO - 10.1109/ISIT.2006.261904

M3 - Article in proceedings

SN - 1-4244-0504-1

BT - ISIT 2006

PB - IEEE Press

CY - Seattle, Washington, USA

T2 - 2006 IEEE International Symposium on Information Theory

Y2 - 9 July 2006 through 14 July 2006

ER -

Graph Codes with Reed-Solomon Component Codes

Abstract

Conference

Bibliographical note

Access to Document

OpenUrl availability

Fingerprint

Cite this