8 papers
Random Reed--Solomon Codes Correcting Permutations, Insertions, and Deletions over Polynomial-Size Alphabets
Yijun Zhang, Yubo Sun, Xiande Zhang +1
We study Reed--Solomon codes against adversarial coordinate permutations followed by insertion-deletion (insdel) errors. It was previously shown by Con (2025) that Reed--Solomon co…
A five-qubit 1-resistant graph state and stabilizer marginal certificates
Zicheng Han, Wanchen Zhang, Xiande Zhang
We study particle-loss resistant entanglement within the framework of stabilizer and graph states. A pure state is \(m\)-resistant if it remains entangled after the loss of any \(m…
An Explicit Scott-Type Bound for Absolutely Maximally Entangled States with Arbitrary Defect
Shixuan Zeng, Xiande Zhang
Absolutely maximally entangled (AME) states and, more generally, -uniform states in $(\C^q)^{\otimes n}$ are central objects in multipartite entanglement theory, with applicatio…
The Hilton-Milner type results of -sum-free sets in
Xin Wei, Xiande Zhang, Gennian Ge
For a prime , it is well known that the largest sum-free subsets of have size , and the extremal sets must be a cuboid o…
Optimal redundancy of function-correcting codes
Gennian Ge, Zixiang Xu, Xiande Zhang +1
Function-correcting codes, introduced by Lenz, Bitar, Wachter-Zeh, and Yaakobi, protect specific function values of a message rather than the entire message. A central challenge is…
On set systems with strongly restricted intersections
Xin Wei, Xiande Zhang, Gennian Ge
Set systems with strongly restricted intersections, called -intersecting families for a vector , were introduced recently as a generalization of several well-studied intersec…
Separating hash families with large universe
Xin Wei, Xiande Zhang, Gennian Ge
Separating hash families are useful combinatorial structures which generalize several well-studied objects in cryptography and coding theory. Let denote the maximum siz…
Swap-Robust and Almost Supermagic Complete Graphs for Dynamical Distributed Storage
Xin Wei, Xiande Zhang, Gennian Ge
To prevent service time bottlenecks in distributed storage systems, the access balancing problem has been studied by designing almost supermagic edge labelings of certain graphs to…