Minimal linear codes in odd characteristic

11/16/2018
by   Daniele Bartoli, et al.
0

In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field F_q, q odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/19/2019

An inductive construction of minimal codes

We provide new families of minimal codes in any characteristic. Also, an...
research
11/25/2019

Minimal Linear Codes Constructed from Functions

In this paper, we consider minimal linear codes in a general constructio...
research
08/17/2020

Optimal minimal Linear codes from posets

Recently, some infinite families of minimal and optimal binary linear co...
research
11/26/2019

A geometric characterization of minimal codes and their asymptotic performance

In this paper, we give a geometric characterization of minimal linear co...
research
08/05/2019

Minimal linear codes from characteristic functions

Minimal linear codes have interesting applications in secret sharing sch...
research
04/12/2022

Unique Optima of the Delsarte Linear Program

The Delsarte linear program is used to bound the size of codes given the...
research
04/01/2023

Monomial codes under linear algebra point of view

The monomial codes over a Galois field F_q that can be thought invariant...

Please sign up or login with your details

Forgot password? Click here to reset