Hermitian Hulls of Rational Algebraic Geometry Codes and Applications in Quantum Codes
Lin Sok, Martianus Frederic Ezerman, and Ling San

TL;DR
This paper develops a method to determine Hermitian hull dimensions of algebraic geometry codes using algebraic function fields, enabling the construction of new entanglement-assisted quantum error-correcting codes with optimal parameters.
Contribution
It introduces a systematic approach to estimate Hermitian hull dimensions of AG codes and constructs new MDS EAQECCs with improved parameters.
Findings
Established a lower bound for Hermitian hull dimensions of AG codes.
Constructed two new families of MDS EAQECCs with optimal parameters.
Demonstrated the effectiveness of the approach using algebraic function fields.
Abstract
Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual distance can be systematically determined. Such a code can serve as an ingredient in designing the parameters of entanglement-assisted quantum error-correcting codes (EAQECCs). We use tools from algebraic function fields of one variable to efficiently determine a good lower bound on the Hermitian hull dimensions of generalized rational algebraic geometry (AG) codes. We identify families of AG codes whose hull dimensions can be well estimated by a lower bound. Given such a code, the idea is to select a set of evaluation points for which the residues of the Weil differential associated with the Hermitian dual code has an easily verifiable property. The…
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
TopicsQuantum Computing Algorithms and Architecture · Coding theory and cryptography · Polynomial and algebraic computation
