scientific article; zbMATH DE number 5010757
From MaRDI portal
Publication:3374402
Recommendations
- Codes from Expander Graphs
- Good Expander Graphs and Expander Codes: Parameters and Decoding
- scientific article; zbMATH DE number 1552123
- On expander codes
- scientific article; zbMATH DE number 7759458
- Codes over graphs
- Graph-based codes
- On graphs and codes
- Expander graphs and their applications
- On the sizes of expander graphs and minimum distances of graph codes
Cited in
(16)- Fast scramblers, horizons and expander graphs
- On the sizes of expander graphs and minimum distances of graph codes
- Computation of best possible low degree expanders
- Graph connectivities, network coding, and expander graphs
- Expander graphs in pure and applied mathematics
- Codes from Expander Graphs
- Improving the Alphabet-Size in Expander-Based Code Constructions
- Optimal bipartite Ramanujan graphs from balanced incomplete block designs: their characterizations and applications to expander/LDPC codes
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- scientific article; zbMATH DE number 1552123 (Why is no real title available?)
- Expander graph arguments for message-passing algorithms
- Algorithms for generation of Ramanujan graphs, other expanders and related LDPC codes
- Generalized Alon--Boppana Theorems and Error-Correcting Codes
- A new formula for the minimum distance of an expander code
- scientific article; zbMATH DE number 7759458 (Why is no real title available?)
- Beyond the expanders
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374402)
