Weight distribution and decoding of codes on hypergraphs

Advances in Mathematics of Communications

Volumn 2, Issue 4, 2008, Pages 433-450

  Barg, Alexander ^a,b   Mazumdar, Arya ^c   Zémor, Gilles ^d  

^a UNIVERSITY OF MARYLAND   (United States)

^b INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

^c UNIVERSITY OF MARYLAND   (United States)

^d UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

Codes on graphs; Decoding; Hypergraphs; Weight distribution

Indexed keywords

EID: 70349326628     PISSN: 19305346     EISSN: 19305338     Source Type: Journal    
DOI: 10.3934/amc.2008.2.433     Document Type: Article

References (6)

1. A. Barg and G. Zémor, Distance properties of expander codes, IEEE Trans. Inform. Theory, 52 (2006), 78-90.
2. Y. Bilu and S. Hoory, On codes from hypergraphs, European. J. Combin., 25 (2004), 339-354.
3. J. Boutros, O. Pothier and G. Zémor, Generalized low density (Tanner) codes, in " Proc. IEEE ICC, " Vancouver, Canada, 1 (1999), 441-445.
4. M. Lentmaier and K. Sh. Zigangirov, On generalized low-density parity-check codes based on Hamming component codes, IEEE Communications Letters, 3 (1999), 248-260.
5. M. Sipser and D. A. Spielman, Expander codes, IEEE Trans. Inform. Theory, 42 (1996), 1710-1722.
6. G. Zémor, On expander codes, IEEE Trans. Inform. Theory, 47 (2001), 835-837.