BARG, Alexander; MAZUMDAR, Arya; ZÉMOR, Gilles

doi:10.3934/amc.2008.2.433

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

BARG, Alexander
Dept. of ECE and Institute for Systems Research, university of Maryland

MAZUMDAR, Arya
Dept. of ECE and Institute for Systems Research, university of Maryland

ZÉMOR, Gilles
Institut de Mathématiques de Bordeaux [IMB]

Langue

Article de revue

Ce document a été publié dans

Advances in Mathematics of Communications. 2008-11, vol. 2, n° 4, p. 433 - 450

AIMS

Résumé en anglais

Codes on hypergraphs are an extension of the well-studied family of codes on bipartite graphs. Bilu and Hoory (2004) constructed an explicit family of codes on regular [t] -partite hypergraphs whose minimum distance improves earlier estimates of the distance of bipartite-graph codes. They also suggested a decoding algorithm for such codes and estimated its error-correcting capability. In this paper we study two aspects of hypergraph codes. First, we compute the weight enumerators of several ensembles of such codes, establishing conditions under which they attain the Gilbert-Varshamov bound and deriving estimates of their distance. In particular, we show that this bound is attained by codes constructed on a fixed bipartite graph with a large spectral gap. We also suggest a new decoding algorithm of hypergraph codes that corrects a constant fraction of errors, improving upon the algorithm of Bilu and Hoory.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

Weight distribution and decoding of codes on hypergraphs

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche