List-decoding Barnes-Wall lattices
From MaRDI portal
Publication:2410678
DOI10.1007/s00037-016-0151-xzbMath1405.94133arXiv1112.1994OpenAlexW2576510311MaRDI QIDQ2410678
Chris Peikert, Elena Grigorescu
Publication date: 18 October 2017
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1112.1994
Analysis of algorithms and problem complexity (68Q25) Combinatorial codes (94B25) Decoding (94B35) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75)
Related Items (4)
List-decoding Barnes-Wall lattices ⋮ Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices ⋮ Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding ⋮ A new complex reflection group in \(PU(9,1)\) and the Barnes-Wall lattice
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved list decoding algorithm for the second order Reed-Muller codes and its applications
- Decoding of Reed Solomon codes beyond the error-correction bound
- List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
- List-decoding Barnes-Wall lattices
- Recursive error correction for general Reed--Muller codes
- Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
- Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors
- Explicit capacity-achieving list-decodable codes
- List Decoding Tensor Products and Interleaved Codes
- Generalized minimum-distance decoding of Euclidean-space codes and lattices
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Soft-decision decoding of Reed-Muller codes: recursive lists
- List Decoding of<tex>$q$</tex>-ary Reed–Muller Codes
- Augmented Product Codes and Lattices: Reed–Muller Codes and Barnes–Wall Lattices
- Near-optimal sparse fourier representations via sampling
- Rigorous and Efficient Short Lattice Vectors Enumeration
- List Decoding of Biorthogonal Codes and the Hadamard Transform With Linear Complexity
- Minkowski's Convex Body Theorem and Integer Programming
- Coset codes. II. Binary lattices and related codes
- Some extreme forms defined in terms of Abelian groups
- Learning Decision Trees Using the Fourier Spectrum
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Generalized minimum distance decoding in Euclidean space: performance analysis
- Soft-decision majority decoding of Reed-Muller codes
- Hardness of approximating the minimum distance of a linear code
- Trellis complexity and minimal trellis diagrams of lattices
- Extractor codes
- Weight Distribution and List-Decoding Size of Reed–Muller Codes
- Extractors and pseudorandom generators
- Algorithmic Results in List Decoding
- Pseudorandom generators without the XOR lemma
- The invariants of the Clifford groups
This page was built for publication: List-decoding Barnes-Wall lattices
