November  2008, 2(4): 433-450. doi: 10.3934/amc.2008.2.433

Weight distribution and decoding of codes on hypergraphs

1. 

Dept. of ECE and Institute for Systems Research, University of Maryland, College Park, MD 20742

2. 

Department of Electrical and Computer Engineering, University of Maryland, College Park, MD 20742, United States

3. 

Institut de Mathématiques de Bordeaux, Université de Bordeaux 1, 351 cours de la Libération, 33405 Talence, France

Received  July 2008 Revised  October 2008 Published  November 2008

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.
Citation: Alexander Barg, Arya Mazumdar, Gilles Zémor. Weight distribution and decoding of codes on hypergraphs. Advances in Mathematics of Communications, 2008, 2 (4) : 433-450. doi: 10.3934/amc.2008.2.433
[1]

Agnaldo José Ferrari, Tatiana Miguel Rodrigues de Souza. Rotated $ A_n $-lattice codes of full diversity. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020118

2019 Impact Factor: 0.734

Metrics

  • PDF downloads (62)
  • HTML views (0)
  • Cited by (6)

Other articles
by authors

[Back to Top]