3 papers
cs.IT2026
The Code Distortion Problem
Huck Bennett, Matthew Fox, Bryant Morrell
Two linear error-correcting codes are called linearly equivalent if there is a linear isometry mapping to . I…
cs.DS2026
On (Non-)Isomorphism of Self-Dual Lattices and Codes
Huck Bennett, Kyle Fridberg
A recent line of work motivated by cryptographic applications has studied the complexity of the Lattice Isomorphism Problem (LIP). In this work, we study LIP on self-dual lattices…
cs.CC2026
Hardness of the Binary Covering Radius Problem in Large Norms
Huck Bennett, Peter Ly
We study the hardness of the -approximate decisional Covering Radius Problem on lattices in the norm (-). Specifically, we prove that there is an ex…