Codes on hypergraphs

Simple item page
dc.creatorBarg, Alexander
dc.creatorMazumdar, Arya
dc.creatorZémor, Gilles
dc.date2008-08-26
dc.date2008-08-30
dc.date.accessioned2026-07-07T12:10:37Z
dc.date.available2026-07-07T12:10:37Z
dc.descriptionCodes 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.
dc.description16 pages
dc.identifierhttps://arxiv.org/abs/0808.3453
dc.identifierhttp://arxiv.org/abs/0808.3453
dc.identifierAdvances in Mathematics of Communications (AMC), Vol. 2, No 4, (2008) pp. 433 - 450.
dc.identifierdoi:10.3934/amc.2008.2.433
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/209985
dc.subjectInformation Theory
dc.titleCodes on hypergraphs
dc.typetext

Files

Collections

arXiv