A new construction of Algebraic Geometry code using Trace function

02/29/2020
by   Nupur Patanker, et al.
0

In this note, we give a construction of Algebraic-Geometry codes on algebraic function field F/ F_q using places of F (not necessarily of degree one) and trace functions from various extensions of F_q. We compute a bound on the dimension of this code. We also determine a bound on the minimum distance of this code in terms of B_r(F) ( the number of places of degree r in F), 1 ≤ r < ∞. This code is a generalization of the geometric Goppa code, with no restriction on the length of the code except the support condition on divisors defining the code. We obtained few quasi-cyclic codes over F_p as examples of these codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/01/2023

On Linear Codes with Random Multiplier Vectors and the Maximum Trace Dimension Property

Let C be a linear code of length n and dimension k over the finite field...
research
12/28/2017

Nearly linear time encodable codes beating the Gilbert-Varshamov bound

We construct explicit nearly linear time encodable error-correcting code...
research
01/11/2022

Improving the minimum distance bound of Trace Goppa codes

In this article we prove that a class of Goppa codes whose Goppa polynom...
research
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...
research
07/14/2020

Coding theory package for Macaulay2

In this Macaulay2 <cit.> package we define an object called linear code....
research
04/28/2023

Polynomial time attack on high rate random alternant codes

A long standing open question is whether the distinguisher of high rate ...
research
03/23/2020

Projective toric codes

Any integral convex polytope P in R^N provides a N-dimensional toric var...

Please sign up or login with your details

Forgot password? Click here to reset