Name
Abstract | ||
|---|---|---|
We describe a new family of integer lattices built from construction A and non-binary LDPC codes. An iterative message-passing algorithm suitable for decoding in high dimensions is proposed. This family of lattices, referred to as LDA lattices, follows the recent transition of Euclidean codes from their classical theory to their modern approach as announced by the pioneering work of Loeliger (1997), Erez, Litsyn, and Zamir (2004-2005). Besides their excellent performance near the capacity limit, LDA lattice construction is conceptually simpler than previously proposed lattices based on multiple nested binary codes and LDA decoding is less complex than real-valued message passing. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/ITW.2012.6404707 | Information Theory Workshop |
Keywords | Field | DocType |
binary codes,iterative decoding,message passing,parity check codes,Euclidean codes,LDA decoding,LDA lattices,capacity limit,construction A,high dimension decoding,integer low-density lattices,iterative message-passing,multiple nested binary codes,nonbinary LDPC codes | Discrete mathematics,Concatenated error correction code,Combinatorics,Berlekamp–Welch algorithm,Sequential decoding,Low-density parity-check code,Computer science,Block code,Serial concatenated convolutional codes,Theoretical computer science,Linear code,List decoding | Conference |
ISBN | Citations | PageRank |
978-1-4673-0222-7 | 27 | 1.10 |
References | Authors | |
14 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nicola di Pietro | 1 | 96 | 8.06 |
| Nicola di Pietro | 2 | 96 | 8.06 |
| Joseph Jean Boutros | 3 | 228 | 24.65 |
| Gilles Zémor | 4 | 587 | 90.40 |
| Loïc Brunel | 5 | 147 | 14.09 |