DeepAI AI Chat
Log In Sign Up

Minimal codewords in Norm-Trace codes

11/04/2022
by   Daniele Bartoli, et al.
Università Perugia
0

In this paper, we consider the affine variety codes obtained evaluating the polynomials by=a_kx^k+…+a_1x+a_0, b,a_i∈𝔽_q^r, at the affine _q^r-rational points of the Norm-Trace curve. In particular, we investigate the weight distribution and the set of minimal codewords. Our approach, which uses tools of algebraic geometry, is based on the study of the absolutely irreducibility of certain algebraic varieties.

READ FULL TEXT

page 1

page 2

page 3

page 4

09/24/2022

Decreasing norm-trace codes

This paper introduces decreasing norm-trace codes, which are evaluation ...
02/10/2021

Rational points on cubic surfaces and AG codes from the Norm-Trace curve

In this paper we give a complete characterization of the intersections b...
12/26/2021

Explicit non-special divisors of small degree and LCD codes from Kummer extensions

A linear code is linear complementary dual, or LCD, if and only if the i...
08/30/2022

Some interesting birational morphisms of smooth affine quadric 3-folds

We study a family of birational maps of smooth affine quadric 3-folds x_...
10/18/2021

Affine Hermitian Grassmann Codes

The Grassmannian is an important object in Algebraic Geometry. One of th...
02/06/2018

Polynomial Invariants for Affine Programs

We exhibit an algorithm to compute the strongest polynomial (or algebrai...
01/12/2022

Sparse trace tests

We establish how the coefficients of a sparse polynomial system influenc...