Linear time decoding of regular expander codes

DOI10.1145/2090236.2090251zbMath1348.94105OpenAlexW2130816127MaRDI QIDQ2826053

Michael Viderman

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

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

zbMATH Keywords

decodingerror-correcting codesLDPC codesexpander codes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear codes (general theory) (94B05) Parallel algorithms in computer science (68W10) Decoding (94B35)

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

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