An improved method for constructing linear codes with small hulls

04/10/2022
by   Shitao Li, et al.
0

In this paper, we give a method for constructing linear codes with small hulls by generalizing the method in <cit.>. As a result, we obtain many optimal Euclidean LCD codes and Hermitian LCD codes, which improve the previously known lower bound on the largest minimum distance. We also obtain many optimal codes with one-dimension hull. Furthermore, we give three tables about formally self-dual LCD codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/28/2021

Construction of binary LCD codes, ternary LCD codes and quaternary Hermitian LCD codes

We give two methods for constructing many linear complementary dual (LCD...
research
08/28/2021

Construction for both self-dual codes and LCD codes

From a given [n, k] code C, we give a method for constructing many [n, k...
research
03/19/2021

A new method for constructing linear codes with small hulls

The hull of a linear code over finite fields is the intersection of the ...
research
06/10/2022

Improved lower and upper bounds for LCD codes?

Linear complementary dual (LCD) codes are linear codes which intersect t...
research
02/02/2023

New Constructions of Optimal Binary LCD Codes

Linear complementary dual (LCD) codes can provide an optimum linear codi...
research
11/09/2020

On the classification of quaternary optimal Hermitian LCD codes

We propose a method for a classification of quaternary Hermitian LCD cod...
research
02/23/2020

Speeding up the AIFV-2 dynamic programs by two orders of magnitude using Range Minimum Queries

AIFV-2 codes are a new method for constructing lossless codes for memory...

Please sign up or login with your details

Forgot password? Click here to reset