Symmetric unique neighbor expanders and good LDPC codes
Author:
- 1 October 2016
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 211, 211-216
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- ERC
This publication has 7 references indexed in Scilit:
- Explicit constructions of Ramanujan complexes of typeEuropean Journal of Combinatorics, 2005
- Expander codesIEEE Transactions on Information Theory, 1996
- Eigenvalues and expansion of regular graphsJournal of the ACM, 1995
- Explicit construction of linear sized tolerant networksDiscrete Mathematics, 1988
- Ramanujan graphsCombinatorica, 1988
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- The minimum distance of all binary cyclic codes of odd lengths from 69 to 99IEEE Transactions on Information Theory, 1978