Algebraic Geometry codes in the sum-rank metric

03/15/2023
by   Elena Berardini, et al.
0

We introduce the first geometric construction of codes in the sum-rank metric, which we called linearized Algebraic Geometry codes, using quotients of the ring of Ore polynomials with coefficients in the function field of an algebraic curve. We study the parameters of these codes and give lower bounds for their dimension and minimum distance. Our codes exhibit quite good parameters, respecting a similar bound to Goppa's bound for Algebraic Geometry codes in the Hamming metric.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2021

Twisted Linearized Reed-Solomon Codes: A Skew Polynomial Framework

We provide an algebraic description for sum-rank metric codes, as quotie...
research
01/25/2018

Algebraic Geometric codes on Hirzebruch surfaces

We define a linear code C_η(δ_T,δ_X) by evaluating polynomials of bidegr...
research
09/02/2020

Algebraic geometry codes and some applications

This article surveys the development of the theory of algebraic geometry...
research
06/12/2018

Codes and Stability

We introduce new yet easily accessible codes for elements of GL_r(A) wit...
research
05/10/2019

Persistent homology of the sum metric

Given finite metric spaces (X, d_X) and (Y, d_Y), we investigate the per...
research
01/18/2022

Rank-Metric Codes, Semifields, and the Average Critical Problem

We investigate two fundamental questions intersecting coding theory and ...
research
03/13/2021

On Bounds for Ring-Based Coding Theory

Coding Theory where the alphabet is identified with the elements of a ri...

Please sign up or login with your details

Forgot password? Click here to reset