Implementing gradient descent decoding
From MaRDI portal
Publication:1024881
DOI10.1307/mmj/1242071693zbMath1169.94017OpenAlexW1978973334MaRDI QIDQ1024881
Publication date: 17 June 2009
Published in: Michigan Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1307/mmj/1242071693
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Decoding (94B35)
Related Items
On the ideal associated to a linear code ⋮ Decomposition of modular codes for computing test sets and Graver basis
Uses Software
Cites Work
- Modern Coding Theory
- Pseudocodewords of Tanner Graphs
- Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes
- Low-density parity-check codes based on finite geometries: a rediscovery and new results
- Minimal vectors in linear codes
- The art of signaling: fifty years of coding theory
- Voronoi regions for binary linear block codes
