A class of LCD BCH codes of length n=q^m+1/λ

05/19/2023
by   Yanhui Zhang, et al.
0

LCD BCH codes are an important class of cyclic codes which have efficient encoding and decoding algorithms, but their parameters are difficult to determine. The objective of this paper is to study the LCD BCH codes of length n=q^m+1/λ, where λ| (q+1) is an integer. Several types of LCD BCH codes with good parameters are presented, and many optimal linear codes are settled. Moreover, we present the first few largest coset leaders modulo n=q^m+1, q^m+1/2,3^m+1/4, and partially solve two conjectures about BCH codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/22/2021

BCH codes over (q) with length q^m+1

BCH codes are an interesting class of cyclic codes due to their efficien...
research
07/24/2023

Two types of negacyclic BCH codes

Negacyclic BCH codes are an important subclass of negacyclic codes, whic...
research
11/17/2019

Projection decoding of some binary optimal linear codes of lengths 36 and 40

Practically good error-correcting codes should have good parameters and ...
research
02/12/2023

Efficient Integer Retrieving from Unordered Compressed Sequences

The variable-length Reverse Multi-Delimiter (RMD) codes are known to rep...
research
09/28/2021

The q-ary antiprimitive BCH codes

It is well-known that cyclic codes have efficient encoding and decoding ...
research
11/28/2022

Three classes of BCH codes and their duals

BCH codes are an important class of cyclic codes, and have wide applican...
research
01/24/2019

On an open problem about a class of optimal ternary cyclic codes

Cyclic codes are a subclass of linear codes and have applications in con...

Please sign up or login with your details

Forgot password? Click here to reset