Fast Decoding of Expander Codes
From MaRDI portal
Publication:4566680
Cited in
(6)- Fast tabular decoding method for multi-delimiter codes
- Fast and Compact Prefix Codes
- Fast Essentially Maximum Likelihood Decoding of the Golden Code
- Simple Codes and Sparse Recovery with Fast Decoding
- Linear-time decoding from a constant fraction of errors for irregular expander codes
- When can an expander code correct (n) errors in O(n) time?
This page was built for publication: Fast Decoding of Expander Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4566680)