Good expander graphs and expander codes: parameters and decoding

DOI10.1007/3-540-44828-4_14MaRDI QIDQ4426691zbMATH OpenOpenAlexFDO

Authors Heeralal Janwa

Publication date 16 September 2003

Published in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44828-4_14

zbMATH Keywords

boundsdecoding algorithmexpander codesexpander graphs

Mathematics Subject Classification ID

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

Recommendations

• Expander codes
• Linear time decoding of regular expander codes
• Constructing error-correcting codes from expander graphs
• On expander codes
• Linear-time decoding of regular expander codes

Cited in

(7)

• Linear time decoding of regular expander codes
• Linear-time decoding of regular expander codes
• Expander codes
• scientific article; zbMATH DE number 5010757 (Why is no real title available?)
• Explicit constructions of asymptotic families of constant degree expander graphs from AG codes
• Codes from Expander Graphs
• scientific article; zbMATH DE number 7759458 (Why is no real title available?)

This page was built for publication: Good expander graphs and expander codes: parameters and decoding

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