Zhi-Hao Guan

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

It is demonstrated that curves with many rational points allow for nearly optimal codes over significantly smaller alphabets, and the existence of random AG codes that approach the half-Singleton bound with high probability over fields of size, breaking the linear field size barrier.