Low-Complexity Decoding via Reduced Dimension Maximum-Likelihood Search
From MaRDI portal
Publication:4570829
Cited in
(6)- Dynamic Re-Encoding During MDD Minimization
- A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding
- Statistical Pruning for Near-Maximum Likelihood Decoding
- New approaches to reduced-complexity decoding
- Statistical decoding 2.0: reducing decoding to LPN
- A tensor-based approach for frequency-selective MIMO channel equalization
This page was built for publication: Low-Complexity Decoding via Reduced Dimension Maximum-Likelihood Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570829)