DeepAI
Log In Sign Up

Residues of skew rational functions and linearized Goppa codes

08/22/2019
by   Xavier Caruso, et al.
0

This paper constitutes a first attempt to do analysis with skew polynomials. Precisely, our main objective is to develop a theory of residues for skew rational functions (which are, by definition, the quotients of two skew polynomials). We prove in particular a skew analogue of the residue formula and a skew analogue of the classical formula of change of variables for residues. We then use our theory to define and study a linearized version of Goppa codes. We show that these codes meet the Singleton bound (for the sum-rank metric) and are the duals of the linearized Reed-Solomon codes defined recently by Martínez-Peñas. We also design efficient encoding and decoding algorithms for them.

READ FULL TEXT

page 1

page 2

page 3

page 4

10/25/2021

Duals of linearized Reed-Solomon codes

We give a description of the duals of linearized Reed-Solomon codes in t...
07/26/2022

A formalization of the change of variables formula for integrals in mathlib

We report on a formalization of the change of variables formula in integ...
05/20/2020

Fast Decoding of Codes in the Rank, Subspace, and Sum-Rank Metric

We speed up existing decoding algorithms for three code classes in diffe...
07/22/2022

Jacobi polynomials and design theory I

In this paper, we introduce the notion of Jacobi polynomials with multip...
08/05/2021

The Key Equation for One-Point Codes

For Reed-Solomon codes, the key equation relates the syndrome polynomial...
02/01/2016

Holonomic Tools for Basic Hypergeometric Functions

With the exception of q-hypergeometric summation, the use of computer al...