Local testing of lattices

DOI10.1137/17M1110353MaRDI QIDQ4565131zbMATH OpenOpenAlexFDO

Authors Karthekeyan Chandrasekaran, Mahdi Cheraghchi, Venkata Gandikota, Elena Grigorescu

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

zbMATH Keywords

construction-Dlatticeslinear testlocally testable codesproperty testing

Mathematics Subject Classification ID

Lattice packing and covering (number-theoretic aspects) (11H31) Linear codes (general theory) (94B05)

Recommendations

• Local testing for membership in lattices
• Locally Testable Codes Require Redundant Testers
• Testing Reed–Muller Codes
• Bounds on \(2\)-query codeword testing
• scientific article; zbMATH DE number 2063208

Cites work

• L_p-testing
• Algebraic property testing: the role of invariance
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Connections between Construction D and related constructions of lattices
• Coset codes. I. Introduction and geometrical classification
• Cryptographic functions from worst-case complexity assumptions
• Fast integer programming in fixed dimension
• Hiding information and signatures in trapdoor knapsacks
• scientific article; zbMATH DE number 3865148 (Why is no real title available?)
• scientific article; zbMATH DE number 4213909 (Why is no real title available?)
• scientific article; zbMATH DE number 2120513 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• Integer Programming with a Fixed Number of Variables
• Lattice-Based Cryptography
• Lattices Which Are Good for (Almost) Everything
• Minkowski's Convex Body Theorem and Integer Programming
• On the construction of dense lattices with a given automorphisms group
• Optimal testing of Reed-Muller codes
• Probabilistic checking of proofs
• Proof verification and the hardness of approximation problems
• Reducibility among combinatorial problems
• Robust Characterizations of Polynomials with Applications to Program Testing
• Self-testing/correcting with applications to numerical problems
• Short locally testable codes and proofs: a survey in two parts
• Some 3CNF Properties Are Hard to Test
• Sphere Packings and Error-Correcting Codes
• Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
• Testing Reed–Muller Codes
• Tolerant Linearity Testing and Locally Testable Codes
• Tolerant property testing and distance approximation

Cited in

(6)

• 2-transitivity is insufficient for local testability
• Testing equality under the local broadcast model
• Low Rate Is Insufficient for Local Testability
• Local testing for membership in lattices
• On lattice constructions D and D^ from q-ary linear codes
• Local tests for consistency of support hyperplane data.

This page was built for publication: Local testing of lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4565131)