14 citations · 44 across the 12 of their papers we have counts for
15 papers
Improving the Constant in the Aharonov--Regev Theorem
Shuhong Gao
The Aharonov-Regev proof that lies in uses a verifier that tests dual lattice vectors; its proof gives . We stud…
Counterexamples to the Jacobian conjecture in dimensions greater than two
Shuhong Gao
The Jacobian conjecture, open since 1939, asks whether every polynomial map of $\C^n$ whose Jacobian determinant is a nonzero constant must have a polynomial inverse. It was refute…
Bounded Distance Decoding for Random Lattices
Shuhong Gao
The current paper investigates the bounded distance decoding (BDD) problem for ensembles of lattices whose generator matrices have sub-Gaussian entries. We first prove that, for th…
On binomial Weil sums and an application
Kaimin Cheng, Shuhong Gao
Let be a prime, and be a positive integer not divisible by . Denote by the multiplicative order of modulo . Let represent the fini…
Linear Complexity of A Family of Binary -periodic Sequences From Euler Quotients
Jingwei Zhang, Shuhong Gao, Chang-An Zhao
We first introduce a family of binary -periodic sequences based on the Euler quotients modulo , where and are two distinct odd primes and divides . The m…
Optimal Bounds for Johnson-Lindenstrauss Transformations
Michael Burr, Shuhong Gao, Fiona Knoll
In 1984, Johnson and Lindenstrauss proved that any finite set of data in a high-dimensional space can be projected to a lower-dimensional space while preserving the pairwise Euclid…