Two classes of constacyclic codes with a square-root-like lower bound
Information Theory
2024-04-30 v1 math.IT
Abstract
Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic structure. In this paper, an infinite class of -ary negacyclic codes of length and an infinite class of -ary constacyclic codes of length are constructed and analyzed. As a by-product, two infinite classes of ternary negacyclic self-dual codes with a square-root-like lower bound on their minimum distances are presented.
Cite
@article{arxiv.2404.18438,
title = {Two classes of constacyclic codes with a square-root-like lower bound},
author = {Tingfang Chen and Zhonghua Sun and Conghui Xie and Hao Chen and Cunsheng Ding},
journal= {arXiv preprint arXiv:2404.18438},
year = {2024}
}