Xiande Zhang

collaborators

4 papers

cs.IT2026

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…

quant-ph2026

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…

math.CO2025

The Hilton-Milner type results of $(k, ℓ)$ -sum-free sets in $F_{p}^{n}$

Xin Wei, Xiande Zhang, Gennian Ge

For a prime $p \equiv 2 (mod 3)$ , it is well known that the largest sum-free subsets of $F_{p}^{n}$ have size $\frac{p + 1}{3} p^{n - 1}$ , and the extremal sets must be a cuboid o…

cs.IT2025

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…

Random Reed--Solomon Codes Correcting Permutations, Insertions, and Deletions over Polynomial-Size Alphabets

A five-qubit 1-resistant graph state and stabilizer marginal certificates

The Hilton-Milner type results of (k,ℓ)-sum-free sets in Fpn​

Optimal redundancy of function-correcting codes

The Hilton-Milner type results of $(k, ℓ)$ -sum-free sets in $F_{p}^{n}$