Linear-time decoding of regular expander codes

DOI10.1145/2493252.2493255MaRDI QIDQ2947583zbMATH OpenOpenAlexFDO

Authors Michael Viderman

Publication date 24 September 2015

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2493252.2493255

zbMATH Keywords

error-correcting codesLDPC codesdecodingexpander codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Decoding (94B35)

Recommendations

• Linear time decoding of regular expander codes
• On expander codes
• Good Expander Graphs and Expander Codes: Parameters and Decoding
• Expander codes
• Improved Nearly-MDS Expander Codes

Cited in

(13)

• Efficient decoding of random errors for quantum expander codes
• Local correctability of expander codes
• Local correctability of expander codes
• scientific article; zbMATH DE number 1512691 (Why is no real title available?)
• Linear time decoding of regular expander codes
• scientific article; zbMATH DE number 1552123 (Why is no real title available?)
• LP decoding of codes with expansion parameter above \(2/3\)
• Linear-time decoding from a constant fraction of errors for irregular expander codes
• On expander codes
• Linear time encodable and list decodable codes
• Good Expander Graphs and Expander Codes: Parameters and Decoding
• When can an expander code correct (n) errors in O(n) time?
• Error Exponents of Expander Codes under Linear-Complexity Decoding

This page was built for publication: Linear-time decoding of regular expander codes

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