A quaternary analogue of Tang-Ding codes

09/21/2023
by   Minjia Shi, et al.
0

In a recent paper, Tang and Ding introduced a class of binary cyclic codes of rate close to one half with a designed lower bound on their minimum distance. The definition involves the base 2 expansion of the integers in their defining set. In this paper we propose an analogue for quaternary codes. In addition, the performances of the subfield subcode and of the trace code (two binary cyclic codes) are investigated.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/16/2023

Five infinite families of binary cyclic codes and their related codes with good parameters

Cyclic codes are an interesting type of linear codes and have wide appli...
research
09/10/2020

Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes

In this work, cyclic-skew-cyclic codes and sum-rank BCH codes are introd...
research
05/27/2018

Minimum Distance of New Generalizations of the Punctured Binary Reed-Muller Codes

Motivated by applications in combinatorial design theory and constructin...
research
03/13/2023

Four infinite families of ternary cyclic codes with a square-root-like lower bound

Cyclic codes are an interesting type of linear codes and have wide appli...
research
02/27/2023

Parameters of several families of binary duadic codes and their related codes

Binary duadic codes are an interesting subclass of cyclic codes since th...
research
08/19/2021

A Generalization of Cyclic Code Equivalence Algorithm to Constacyclic Codes

Recently, a new algorithm to test equivalence of two cyclic codes has be...
research
07/10/2020

On the Performance of Direct Shaping Codes

In this work, we study a recently proposed direct shaping code for flash...

Please sign up or login with your details

Forgot password? Click here to reset