Codes on hypergraphs

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.

[1]  Ron M. Roth,et al.  Improved Nearly-MDS Expander Codes , 2006, IEEE Transactions on Information Theory.

[2]  Rolf Johannesson,et al.  Asymptotically Good Woven Codes with Fixed Constituent Convolutional Codes , 2007, 2007 IEEE International Symposium on Information Theory.

[3]  J. Boutros,et al.  Generalized low density (Tanner) codes , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[4]  Alexander Barg,et al.  Distance properties of expander codes , 2004, IEEE Transactions on Information Theory.

[5]  Robert Michael Tanner,et al.  A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[6]  Daniel A. Spielman,et al.  Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  Michael Lentmaier,et al.  On generalized low-density parity-check codes based on Hamming component codes , 1999, IEEE Communications Letters.

[8]  Shlomo Hoory,et al.  On codes from hypergraphs , 2004, Eur. J. Comb..

[9]  Venkatesan Guruswami,et al.  Linear-time encodable/decodable codes with near-optimal rate , 2005, IEEE Transactions on Information Theory.

[10]  Alexander Barg,et al.  Concatenated codes: serial and parallel , 2003, IEEE Transactions on Information Theory.