Work

Two Classes of Constacyclic Codes With a Square-Root-Like Lower Bound

Year: 2024

Type: article

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 q-ary negacyclic codes of length$(q^{m}-1)/2$and an infinite class of q-ary constacyclic codes of length$(q^{m}-1)/(q-1)$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.

Source: IEEE Transactions on Information Theory

DOI: 10.1109/tit.2024.3464630

Authors: Tingfang Chen, Zhonghua Sun, Conghui Xie, Hao Chen, Cunsheng Ding

Institutions: Hong Kong University of Science and Technology, Hefei University of Technology, Jinan University

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: National Natural Science Foundation of China, United Arab Emirates University, Fundamental Research Funds for the Central Universities

Awards: G1853049553, G2817085005, G3296996533, G6816960198