Pure Gaps at Many Places and Multi-point AG Codes from Arbitrary Kummer Extensions
Huachao Zhang, Chang-An Zhao

TL;DR
This paper develops a method to identify pure gaps at many places in Kummer extensions and uses these to construct algebraic geometry codes with improved parameters, including a record-setting code.
Contribution
It introduces a simple, efficient approach to find pure gaps at multiple places in Kummer extensions and fully characterizes these gaps in specific cases, enabling better code construction.
Findings
Method to find all pure gaps at many places in Kummer extensions
Explicit description of pure gaps when parameters are equal
Construction of a new record algebraic geometry code
Abstract
For a Kummer extension defined by the affine equation over an algebraic extension of a finite field , where for , , and are pairwise distinct elements, we propose a simple and efficient method to find all pure gaps at many totally ramified places. We introduce a bottom set of pure gaps and indicate that the set of pure gaps is completely determined by the bottom set. Furthermore, we demonstrate that a pure gap can be deduced from a known pure gap by easily verifying only one inequality. Then, in the case where , we fully determine an explicit description of the set of pure gaps at many totally ramified places, This includes the scenario in which the set of these places contains the infinite place.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · Cryptography and Residue Arithmetic
