Local Testing of Lattices (original) (raw)
Related papers
Local Testing for Membership in Lattices
Electron. Colloquium Comput. Complex., 2016
Algebraic testing and weight distributions of codes
Theoretical Computer Science, 2003
2017
Robust locally testable codes and products of codes
Random Structures and Algorithms, 2006
Construction piA\pi_ApiA and piD\pi_DpiD Lattices: Construction, Goodness, and Decoding Algorithms
arXiv (Cornell University), 2015
Succinct Representation of Codes with Applications to Testing
SIAM Journal on Discrete Mathematics, 2012
Proceedings of the Third Asian Mathematical Conference 2000, 2002
Codes Based on Residuated Lattices
Communications of the Korean Mathematical Society, 2016
A fast encoding method for lattice codes and quantizers
IEEE Transactions on Information Theory, 1983
Order, 1987
The meet operation in the lattice of codes
Theoretical Computer Science, 1998
Optimal testing of Reed-Muller codes
2011
A sieve algorithm for the shortest lattice vector problem
2001
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Privacy
2020
A note on the shortest lattice vector problem
1999
Efficient algorithms on distributive lattices
Discrete Applied Mathematics, 2001
Codes, lattices and modular forms
Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674)
A Theoretical Aspect of Lattice Based Cryptography
Upper bounds for modular forms, lattices, and codes
Journal of Algebra, 1975
Broadcast Attacks against Lattice-Based Cryptosystems
Lecture Notes in Computer Science, 2009
The Lattice Structure of Linear Subspace Codes
ArXiv, 2019
L. Natarajan, Emanuele Viterbo
Deciding Orthogonality in Construction-A Lattices
arXiv (Cornell University), 2015
Algebraic lattice constellations: bounds on performance
IEEE Transactions on Information Theory, 2000
On the complexity of decoding lattices using the Korkin-Zolotarev reduced basis
IEEE Transactions on Information Theory, 1998
Construction πA and πD Lattices: Construction, Goodness, and Decoding Algorithms
IEEE Transactions on Information Theory, 2017
On the error performance of the $ A_n $ lattices
2011
List Decoding Barnes-Wall Lattices
2012 IEEE 27th Conference on Computational Complexity, 2012
Reduction-Respecting Parameters for Lattice-Based Cryptosystems
2018
Query-Efficient Locally Decodable Codes of Subexponential Length
computational complexity, 2013
Lattices from Codes for Harnessing Interference: An Overview and Generalizations
2014
Computational Hardness and Explicit Constructions of Error Correcting Codes
Fourty-Fourth Annual …, 2006
2018
GLITCH: A Discrete Gaussian Testing Suite for Lattice-based Cryptography
Proceedings of the 14th International Joint Conference on e-Business and Telecommunications
Lattice signatures using NTRU on the hardness of worst-case ideal lattice problems
IET Information Security, 2020