23 citations · 148 across the 60 of their papers we have counts for
68 papers
On exceptional cliques in matrix rings
Milan Boutros, Ignacio Cascudo, Ronald Cramer +2
We study the notion of exceptional clique, a subset of a ring such that the difference of any two distinct elements of the subset is invertible. Motivated by applications in crypto…
Codes with Biochemical Constraints and Single Error Correction for DNA-Based Data Storage
Shu Liu, Chaoping Xing, Yaqian Zhang
In DNA-based data storage, DNA codes with biochemical constraints and error correction are designed to protect data reliability. Single-stranded DNA sequences with secondary struct…
Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy
Shu Liu, Ivan Tjuawinata, Chaoping Xing
We consider the problem of efficient construction of q-ary 2-deletion correcting codes with low redundancy. We show that our construction requires less redundancy than any existing…
Constructions of -uniform states in heterogeneous systems
Keqin Feng, Lingfei Jin, Chaoping Xing +1
A pure quantum state of parties associated with the Hilbert space $\CC^{d_1}\otimes \CC^{d_2}\otimes\cdots\otimes \CC^{d_n}$ is called -uniform if all the reductions to -…
On the Fine-Grained Complexity of Small-Size Geometric Set Cover and Discrete -Center for Small
Timothy M. Chan, Qizheng He, Yuancheng Yu
We study the time complexity of the discrete -center problem and related (exact) geometric set cover problems when or the size of the cover is small. We obtain a plethora of…
A Lower Bound on the List-Decodability of Insdel Codes
Shu Liu, Ivan Tjuawinata, Chaoping Xing
For codes equipped with metrics such as Hamming metric, symbol pair metric or cover metric, the Johnson bound guarantees list-decodability of such codes. That is, the Johnson bound…