scientific article; zbMATH DE number 1775410
From MaRDI portal
Publication:4542543
Recommendations
Cited in
(16)- On the hardness of sampling independent sets beyond the tree threshold
- Multidimensional decoding networks for trapping set analysis
- scientific article; zbMATH DE number 1714653 (Why is no real title available?)
- Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes
- A class of quantum low-density parity check codes by combining seed graphs
- Regular and irregular progressive edge-growth tanner graphs
- The typical performance of irregular low-density generator-matrix codes for lossy compression
- A recursive approach to low complexity codes
- scientific article; zbMATH DE number 3559420 (Why is no real title available?)
- Efficient erasure correcting codes
- Improved low-density parity-check codes using irregular graphs
- Design of capacity-approaching irregular low-density parity-check codes
- Good error-correcting codes based on very sparse matrices
- Graph based linear error correcting codes
- The set of solutions of random XORSAT formulae
- Linear exact repair for dual decomposable codes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4542543)