Science
Explicit and asymptotically good constructions of Algebraic Geometry codes in the sum-rank metric
Key Points
Announce Type: new Abstract: Algebraic Geometry (AG) codes (i.e. linear codes from algebraic function fields) in the Hamming metric were proposed by Goppa in 1980 and have been intensively studied ever since. Linearized Algebraic Geometry codes, the analogue of AG codes in the sum-rank metric, were instead introduced more recently [9], using quotients of the ring of Ore polynomials with coefficients in an algebraic function field.
arXiv:2606.09448v1 Announce Type: new
Abstract: Algebraic Geometry (AG) codes (i.e. linear codes from algebraic function fields) in the Hamming metric were proposed by Goppa in 1980 and have been intensively studied ever since. Linearized Algebraic Geometry codes, the analogue of AG codes in the sum-rank metric, were instead introduced more recently [9], using quotients of the ring of Ore polynomials with coefficients in an algebraic function field. In this paper, we further investigate the results in [9], providing explicit, optimal and asymptotic constructions.