On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
From MaRDI portal
Publication:1934244
DOI10.1007/s10623-012-9724-0zbMath1308.94117OpenAlexW2051959947MaRDI QIDQ1934244
Publication date: 28 January 2013
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/185573
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of the covering radius problem
- Rank 72 high minimum norm lattices
- On Lovász' lattice reduction and the nearest lattice point problem
- On the covering multiplicity of lattices
- Hadamard matrices, Baumert-Hall units, four-symbol sequences, pulse compression, and surface wave encodings
- Spherical codes and designs
- New bounds in some transference theorems in the geometry of numbers
- The Magma algebra system. I: The user language
- On the sphere problem
- Lattice points in high-dimensional spheres
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- A construction of integral lattices
- On maximum-likelihood detection and the search for the closest lattice point
- Lattice Coding and Decoding Achieve the Optimal Diversity–Multiplexing Tradeoff of MIMO Channels
- Soft decoding techniques for codes and lattices, including the Golay code and the Leech lattice
- Coset codes. II. Binary lattices and related codes
- Counting Lattice Points in The Sphere
- An even unimodular 72-dimensional lattice of minimum 8
- Inapproximability Results for Computational Problems on Lattices
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: On the number of lattice points in a small sphere and a recursive lattice decoding algorithm
