On codes from hypergraphs
- 1 April 2004
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 25 (3) , 339-354
- https://doi.org/10.1016/j.ejc.2003.10.002
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Relative expanders or weakly relatively Ramanujan graphsDuke Mathematical Journal, 2003
- Error exponents of expander codesIEEE Transactions on Information Theory, 2002
- On expander codesIEEE Transactions on Information Theory, 2001
- Expander-based constructions of efficiently decodable codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2001
- Expander codesIEEE Transactions on Information Theory, 1996
- Derandomized graph productscomputational complexity, 1995
- Ramanujan graphsCombinatorica, 1988
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981