Some new bounds on LCD codes over finite fields

04/03/2018
by   Binbin Pang, et al.
0

In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD(n,2) over F_3 and F_4. We study the bound of LCD codes over F_q.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/18/2022

Skew constacyclic codes over a class of finite commutative semisimple rings

In this article, we study skew constacyclic codes over a class of finite...
research
03/26/2019

Binary LCD Codes from Z_2Z_2[u]

Linear complementary dual (LCD) codes over finite fields are linear code...
research
10/05/2021

On bases and the dimensions of twisted centralizer codes

Alahmadi et al. ["Twisted centralizer codes", Linear Algebra and its App...
research
04/09/2018

Implementing Line-Hermitian Grassmann codes

In [I. Cardinali and L. Giuzzi. Line Hermitian Grassmann codes and their...
research
02/02/2021

On Skew Convolutional and Trellis Codes

Two new classes of skew codes over a finite field are proposed, called ...
research
08/31/2022

Recategorising research: Mapping from FoR 2008 to FoR 2020 in Dimensions

In 2020 the Australia New Zealand Standard Research Classification Field...
research
01/21/2021

Some punctured codes of several families of binary linear codes

Two general constructions of linear codes with functions over finite fie...

Please sign up or login with your details

Forgot password? Click here to reset