Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

A universal decoding algorithm for lattice codes

Emanuele Viterbo, E. Biglieri

Published Jan 1, 1993• 61 citations
OpenAlex

Related papers

A Bounded-Distance Decoding Algorithm for Lattices Obtained from a Generalized Code Formula

M.A.O. da Costa e SiIva, Reginaldo Palazzo Júnior

A multistage decoding algorithm is given for lattices obtained from a generalized code formula. The corresponding multilevel construction is based on a chain of two-way lattice partitions and a family of binary linear block codes, whereas the multistage algorithm involves the use of a maximum-likelihood (ML) decoding algorithm for each two-way lattice partitions as well as a soft-decision ML decoding algorithm for each binary linear block code. The algorithm is shown to have the same effective error-correcting radius as ML decoding. Several known lattices and two new ones were then constructed by the generalized code formula. The trade-off between complexity reduction and performance loss achieved by the proposed algorithm is presented.

IEEE International Symposium on Information Theory (ISIT)•Aug 24, 2005•0 citations

A decoding algorithm for linear codes

Martin Bossert, F. Hergert

Lecture notes in computer science•Jan 1, 1986•2 citations

Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice

J. Conway, Neil J.A. Sloane

Two kinds of algorithms are considered.1)If *** is a binary code of lengthn, a "soft decision" decoding algorithm for *** changes an arbitrary point ofR^{n}into a nearest codeword (nearest in Euclidean distance).2)Similarly, a decoding algorithm for a lattice\LambdainR^{n}changes an arbitrary point ofR^{n}into a closest lattice point. Some general methods are given for constructing such algorithms, ami are used to obtain new and faster decoding algorithms for the Gosset latticeE_{8}, the Golay code the Leech lattice.

IEEE Transactions on Information Theory•Jan 1, 1986•161 citations

Decoding Methods for Linear Codes

Kenny Barrese

•Jun 4, 2008•0 citations

The decoding of binary quasi-cyclic codes

P. Heijnen, Henk C. A. van Tilborg

•Jan 1, 1998•4 citations

Decoding Toric Codes on Three Dimensional Simplical Complexes

Arun B. Aloshious, Pradeep Kiran Sarvepalli

Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been very few studies on the decoding of 3D toric codes over arbitrary lattices. Color codes in 3D can be mapped to toric codes. However, the resulting toric codes are not defined on cubic lattice. They are arbitrary lattices with triangular faces. Decoding toric codes over an arbitrary lattice will help in studying the performance of color codes. Furthermore, gauge color codes can also be decoded via 3D toric codes. Motivated by this, we propose an efficient algorithm to decode 3D toric codes on arbitrary lattices (with and without boundaries).

arXiv:1911.06056•IEEE Transactions on Information Theory•Nov 10, 2020•7 citations
A multistage decoding algorithm is given for lattices obtained from a generalized code formula. The corresponding multilevel construction is based on a chain of two-way lattice partitions and a family of binary linear block codes, whereas the multistage algorithm involves the use of a maximum-likelihood (ML) decoding algorithm for each two-way lattice partitions as well as a soft-decision ML decoding algorithm for each binary linear block code. The algorithm is shown to have the same effective error-correcting radius as ML decoding. Several known lattices and two new ones were then constructed by the generalized code formula. The trade-off between complexity reduction and performance loss achieved by the proposed algorithm is presented.
Two kinds of algorithms are considered.1)If *** is a binary code of lengthn, a "soft decision" decoding algorithm for *** changes an arbitrary point ofR^{n}into a nearest codeword (nearest in Euclidean distance).2)Similarly, a decoding algorithm for a lattice\LambdainR^{n}changes an arbitrary point ofR^{n}into a closest lattice point. Some general methods are given for constructing such algorithms, ami are used to obtain new and faster decoding algorithms for the Gosset latticeE_{8}, the Golay code the Leech lattice.
Three dimensional (3D) toric codes are a class of stabilizer codes with local checks and come under the umbrella of topological codes. While decoding algorithms have been proposed for the 3D toric code on a cubic lattice, there have been very few studies on the decoding of 3D toric codes over arbitrary lattices. Color codes in 3D can be mapped to toric codes. However, the resulting toric codes are not defined on cubic lattice. They are arbitrary lattices with triangular faces. Decoding toric codes over an arbitrary lattice will help in studying the performance of color codes. Furthermore, gauge color codes can also be decoded via 3D toric codes. Motivated by this, we propose an efficient algorithm to decode 3D toric codes on arbitrary lattices (with and without boundaries).