Codes on hypergraphs
Language
en
Communication dans un congrès
This item was published in
IEEE International Symposium on Information Theory 2008, ISIT 2008, IEEE International Symposium on Information Theory 2008, ISIT 2008, IEEE International Symposium on Information Theory 2008, ISIT 2008, 2008-07, Toronto. 2008-07p. 156-160
English 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 ...Read more >
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.Read less <
Origin
Hal imported