The following pages link to (Q3374402):
Displaying 8 items.
- Fast scramblers, horizons and expander graphs (Q1795837) (← links)
- On the sizes of expander graphs and minimum distances of graph codes (Q2449138) (← links)
- Computation of best possible low degree expanders (Q2462391) (← links)
- Graph connectivities, network coding, and expander graphs (Q2848198) (← links)
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs (Q3990791) (← links)
- Algorithms for generation of Ramanujan graphs, other Expanders and related LDPC codes (Q5377240) (← links)
- A new formula for the minimum distance of an expander code (Q5884135) (← links)
- (Q6059365) (← links)