Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
- 9 April 2022
- journal article
- research article
- Published by Springer Nature in Wireless Personal Communications
- Vol. 125 (3) , 2463-2475
Abstract
No abstract availableKeywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Symmetric LDPC codes and local testingCombinatorica, 2015
- Edge transitive ramanujan graphs and symmetric LDPC good codes2012
- Expander graphs in pure and applied mathematicsBulletin of the American Mathematical Society, 2012
- Lowering the Error Floor of LDPC Codes Using Cyclic LiftingsIEEE Transactions on Information Theory, 2011
- Weaknesses of Margulis and Ramanujan-Margulis Low-Density Parity-Check CodesElectronic Notes in Theoretical Computer Science, 2003
- Cubic Ramanujan graphsCombinatorica, 1992
- Isoperimetric numbers of graphsJournal of Combinatorial Theory, Series B, 1989
- Ramanujan graphsCombinatorica, 1988
- Explicit constructions of graphs without short cycles and low density codesCombinatorica, 1982
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962