AI Chat AI Image Generator AI Video Text to Speech

Duals of linearized Reed-Solomon codes

10/25/2021

∙

by Xavier Caruso, et al.

∙

∙

We give a description of the duals of linearized Reed-Solomon codes in terms of codes obtained by taking residues of Ore rational functions. Our construction shows in particular that, under some assumptions on the base field, the class of linearized Reed-Solomon codes is stable under duality. As a byproduct of our work, we develop a theory of residues in the Ore setting.

Xavier Caruso
20 publications
Amaury Durand
5 publications

page 1

page 2

page 3

page 4

research

∙ 12/20/2019

A new construction of nonlinear codes via rational function fields

It is well known that constructing codes with good parameters is one of ...

0 Lingfei Jin, et al. ∙

research

∙ 08/22/2019

Residues of skew rational functions and linearized Goppa codes

This paper constitutes a first attempt to do analysis with skew polynomi...

0 Xavier Caruso, et al. ∙

research

∙ 07/06/2021

Non-rational Narain CFTs from codes over F_4

We construct a map between a class of codes over F_4 and a family of non...

0 Anatoly Dymarsky, et al. ∙

research

∙ 03/18/2019

A Short Note on Self-Duality of Goppa Codes on Elliptic and Hyperelliptic Function Fields

In this note, we investigate Goppa codes which are constructed by means ...

0 Nupur Patanker, et al. ∙

research

∙ 08/26/2023

Indicator functions, v-numbers and Gorenstein rings in the theory of projective Reed-Muller-type codes

For projective Reed–Muller-type codes we give a duality criterion in ter...

0 Manuel Gonzalez-Sarabia, et al. ∙

research

∙ 12/19/2019

On the algebraic structure of quasi group codes

In this note, an intrinsic description of some families of linear codes ...

0 Martino Borello, et al. ∙

research

∙ 10/09/2015

Comparative computational results for some vertex and facet enumeration codes

We report some computational results comparing parallel and sequential c...

0 David Avis, et al. ∙