Lattice (List) Decoding Near Minkowski’s Inequality

DOI10.1109/TIT.2021.3126540zbMath1489.94178arXiv2010.04809OpenAlexW3214123531MaRDI QIDQ5030328

Chris Peikert, Ethan Mook

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.04809

zbMATH Keywords

polynomial-time algorithmReed-Solomon codesminimum distancelist decodingefficiently constructible higher dimensional latticesGuruswami-Sudan list-decoding algorithmKoetter-Vardy soft decision variant

Mathematics Subject Classification ID

Lattices and convex bodies (number-theoretic aspects) (11H06) Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Relations with coding theory (11H71)

Related Items (1)

On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography

This page was built for publication: Lattice (List) Decoding Near Minkowski’s Inequality