The following pages link to (Q4230352):
Displaying 5 items.
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\) (Q514531) (← links)
- On the second eigenvalue and random walks in random \(d\)-regular graphs (Q1181012) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- High-girth near-Ramanujan graphs with localized eigenvectors (Q2130529) (← links)
- (Q4273623) (← links)