Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs

DOI10.1109/TIT.2022.3222474arXiv2207.07262MaRDI QIDQ6153673FDOQ6153673

Authors: Xiaoqiang Wang, Chun-Ming Tang, Cunsheng Ding 

Publication date: 19 March 2024

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Interplay between coding theory and combinatorial $t$-designs has been a hot topic for many years for combinatorialists and coding theorists. Some infinite families of cyclic codes supporting infinite families of $3$-designs have been constructed in the past 50 years. However, no infinite family of negacyclic codes supporting an infinite family of $3$-designs has been reported in the literature. This is the main motivation of this paper. Let $q=p^m$, where $p$ is an odd prime and $mgeq2$ is an integer. The objective of this paper is to present an infinite family of cyclic codes over $gf(q)$ supporting an infinite family of $3$-designs and two infinite families of negacyclic codes over $gf(q^2)$ supporting two infinite families of $3$-designs. The parameters and the weight distributions of these codes are determined. The subfield subcodes of these negacyclic codes over $gf(q)$ are studied. Three infinite families of almost MDS codes are also presented. A constacyclic code over GF($4$) supporting a $4$-design and six open problems are also presented in this paper.

Full work available at URL: https://arxiv.org/abs/2207.07262

zbMATH Keywords

Steiner systemcyclic codeconstacyclic codet-designnegacyclic code

Mathematics Subject Classification ID

Information and communication theory, circuits (94-XX)

Cited In (1)

• Infinite families of 3-designs from special symmetric polynomials

This page was built for publication: Infinite Families of Cyclic and Negacyclic Codes Supporting 3-Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153673)