From concatenated codes to graph codes

Jørn Justesen, Tom Høholdt

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

378 Downloads (Pure)

Abstract

We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing in trees.
Original languageEnglish
Title of host publicationIEEE Information Theory Workshop, San Antonio
Place of PublicationSan Antonio, Texas
PublisherIEEE
Publication date2004
Pages13-16
ISBN (Print)0-7803-8720-1
DOIs
Publication statusPublished - 2004
EventIEEE Information Theory Workshop, 2004. -
Duration: 1 Jan 2004 → …

Conference

ConferenceIEEE Information Theory Workshop, 2004.
Period01/01/2004 → …

Bibliographical note

Copyright: 2004 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 'From concatenated codes to graph codes'. Together they form a unique fingerprint.

Cite this