DocumentCode
2513151
Title
Codes on hypergraphs
Author
Barg, Alexander ; Zemor, Gilles
Author_Institution
Dept. of ECE, Univ. of Maryland, College Park, MD
fYear
2008
fDate
6-11 July 2008
Firstpage
156
Lastpage
160
Abstract
A generalization of codes on regular bipartite graphs is given by a family of codes on hypergraphs. We derive the average weight distribution and estimate the minimum distance of codes in the random ensemble of hypergraph codes. We also propose an iterative decoding algorithm of hypergraph codes that corrects a larger proportion of errors than known previously for this code family.
Keywords
codes; error correction; graph theory; iterative decoding; random processes; average weight distribution; error correction; hypergraph codes; iterative decoding algorithm; minimum distance; random ensemble; regular bipartite graphs; Algorithm design and analysis; Bipartite graph; Educational institutions; Eigenvalues and eigenfunctions; Error correction codes; Graph theory; Iterative algorithms; Iterative decoding; Linear code; Product codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2008. ISIT 2008. IEEE International Symposium on
Conference_Location
Toronto, ON
Print_ISBN
978-1-4244-2256-2
Electronic_ISBN
978-1-4244-2257-9
Type
conf
DOI
10.1109/ISIT.2008.4594967
Filename
4594967
Link To Document