Zhi-Hao Guan

Random Algebraic Geometry Codes Approach the Half-Singleton Bound for Insertions and Deletions

In this paper, we study the performance of algebraic geometry (AG) codes against adversarial insertion-deletion (insdel) errors. The half-Singleton bound states that an $[n,k]_q$ linear code can correct at most $n-2k+1$ insdel errors. It was recently proven that random Reed-Solomon codes approach this bound. However, t...