Symmetric unique neighbor expanders and good LDPC codes
From MaRDI portal
Publication:335354
DOI10.1016/j.dam.2016.04.022zbMath1348.05094arXiv1605.00240OpenAlexW2346868854MaRDI QIDQ335354
Publication date: 2 November 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.00240
Linear codes (general theory) (94B05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Unnamed Item
- Explicit constructions of Ramanujan complexes of type \(\widetilde A_d\).
- Explicit construction of linear sized tolerant networks
- Ramanujan graphs
- Expander codes
- A recursive approach to low complexity codes
- The minimum distance of all binary cyclic codes of odd lengths from 69 to 99
- Eigenvalues and expansion of regular graphs
- Symmetric LDPC Codes and Local Testing
- Edge transitive ramanujan graphs and symmetric LDPC good codes
This page was built for publication: Symmetric unique neighbor expanders and good LDPC codes