Local Testing of Lattices
From MaRDI portal
Publication:4565131
DOI10.1137/17M1110353zbMath1422.11147OpenAlexW2807135138MaRDI QIDQ4565131
Mahdi Cheraghchi, Karthekeyan Chandrasekaran, Elena Grigorescu, Venkata Gandikota
Publication date: 8 June 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1110353
Linear codes (general theory) (94B05) Lattice packing and covering (number-theoretic aspects) (11H31)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Connections between Construction D and related constructions of lattices
- Self-testing/correcting with applications to numerical problems
- On the construction of dense lattices with a given automorphisms group
- Tolerant property testing and distance approximation
- Integer Programming with a Fixed Number of Variables
- Proof verification and the hardness of approximation problems
- Testing Reed–Muller Codes
- Lattices Which Are Good for (Almost) Everything
- Tolerant Linearity Testing and Locally Testable Codes
- Minkowski's Convex Body Theorem and Integer Programming
- Coset codes. I. Introduction and geometrical classification
- Probabilistic checking of proofs
- Robust Characterizations of Polynomials with Applications to Program Testing
- Short Locally Testable Codes and Proofs: A Survey in Two Parts
- Optimal Testing of Reed-Muller Codes
- Reducibility among Combinatorial Problems
- Cryptographic Functions from Worst-Case Complexity Assumptions
- L p -testing
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Sphere Packings and Error-Correcting Codes
- Some 3CNF Properties Are Hard to Test
- Lattice-Based Cryptography
- Hiding information and signatures in trapdoor knapsacks
- Algorithms - ESA 2003
