Adaptive Soft-Decision Iterative Decoding Using Edge Local Complementation
From MaRDI portal
Publication:3540924
DOI10.1007/978-3-540-87448-5_10zbMath1166.94358arXiv0905.4164OpenAlexW2099802192MaRDI QIDQ3540924
Joakim Grahl Knudsen, Eirik Rosnes, Constanza Riera, Matthew G. Parker
Publication date: 25 November 2008
Published in: Coding Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.4164
Related Items
Cites Work
- Unnamed Item
- On the classification of all self-dual additive codes over \(\text{GF}(4)\) of length up to 12
- Edge local complementation and equivalence of binary linear codes
- Isotropic systems
- Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix
- Factor graphs and the sum-product algorithm
- The capacity of low-density parity-check codes under message-passing decoding
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Good codes based on very sparse matrices
- Finite-length analysis of low-density parity-check codes on the binary erasure channel