Constructing error-correcting codes from expander graphs

MaRDI QIDQ4524330zbMATH OpenFDO

Authors Daniel A. Spielman

Publication date 7 August 2001

zbMATH Keywords

asymptotically good error correcting codesdecodingexpander codesexpander graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Decoding (94B35) Other types of codes (94B60)

Recommendations

• Expander codes
• Linear time decoding of regular expander codes
• On expander codes
• Linear-time decoding of regular expander codes
• scientific article; zbMATH DE number 5010757

Cited in

(14)

• Error-correcting codes from graphs
• Expander codes
• Linear-time encodable and decodable error-correcting codes
• scientific article; zbMATH DE number 5010757 (Why is no real title available?)
• Codes from Expander Graphs
• Decoding of Expander Codes at Rates Close to Capacity
• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• Good expander graphs and expander codes: parameters and decoding
• On expander codes
• Efficient and reliable overlay networks for decentralized federated learning
• Double and Triple Node-Erasure-Correcting Codes Over Complete Graphs
• scientific article; zbMATH DE number 7759458 (Why is no real title available?)
• Explicit construction of \(q+1\) regular local Ramanujan graphs, for all prime-powers \(q\)
• Fractional graph expanders and network dynamics: spectral properties and diffusion with applications to quantum cryptography

This page was built for publication: Constructing error-correcting codes from expander graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4524330)