arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0808.3453cs.ITmath.IT
收藏

超图上的码

Codes on hypergraphs

Alexander Barg, Arya Mazumdar, Gilles Zémor

摘要:

超图上的码是二部图上的码族的扩展。Bilu和Hoory(2004)在正则t-部超图上构造了一个显式的码族,其最小距离改进了先前对二部图码距离的估计。他们还提出了这种码的译码算法,并估计了它的纠错能力。本文主要研究超图码的两个方面。首先,我们计算的重量枚举数的几个合奏这样的代码,建立条件下,他们达到吉尔伯特-Varshamov界和推导估计他们的距离。特别是,我们表明,这个界限是由一个固定的二分图上构造的代码具有很大的频谱间隙。我们还提出了一种新的超图码的译码算法,它纠正了一个常数的错误率,改进了Bilu和Hoory的算法。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑