A Generic Construction on Self-orthogonal Algebraic Geometric Codes and Its Applications
By: Puyin Wang, Jinquan Luo
Potential Business Impact:
Makes codes better for sending secret messages.
In the realm of algebraic geometric (AG) codes, characterizing dual codes has long been a challenging task. In this paper we introduces a generalized criterion to characterize self-orthogonality of AG codes based on residues, drawing upon the rich algebraic structures of finite fields and the geometric properties of algebraic curves. We also present a generic construction of self-orthogonal AG codes from self-dual MDS codes. Using these approaches, we construct several families of self-dual and almost self-dual AG codes. These codes combine two merits: good performance as AG code whose parameters are close to the Singleton bound together with Euclidean (or Hermtian) self-dual/self-orthogonal property. Furthermore, some AG codes with Hermitian self-orthogonality can be applied to construct quantum codes with notably good parameters.
Similar Papers
Construction of Self-Orthogonal Quasi-Cyclic Codes and Their Application to Quantum Error-Correcting Codes
Information Theory
Makes better codes for quantum computers.
Hermitian Self-dual Twisted Generalized Reed-Solomon Codes
Information Theory
Makes secret messages harder to break.
A Construction of Infinite Families of Self-Orthogonal Quasi-Cyclic Codes Using Constituent Codes.pdf
Information Theory
Makes computers better at fixing errors in data.