On the parameters of extended primitive cyclic codes and the related designs

DOI10.1007/S10623-024-01357-2arXiv2306.07718MaRDI QIDQ6440146FDOQ6440146

Authors: Haode Yan, Yanan Yin 

Publication date: 13 June 2023

Abstract: Very recently, Heng et al. studied a family of extended primitive cyclic codes. It was shown that the supports of all codewords with any fixed nonzero Hamming weight of this code supporting 2-designs. In this paper, we study this family of extended primitive cyclic codes in more details. The weight distribution is determined. The parameters of the related $2$-designs are also given. Moreover, we prove that the codewords with minimum Hamming weight supporting 3-designs, which gives an affirmative solution to Heng's conjecture.

Recommendations

• Infinite families of 2‐designs from a class of cyclic codes
• Parameters of 2-designs from some BCH codes
• Some 3-designs and shortened codes from binary cyclic codes with three zeros
• Constructions of cyclic codes and extended primitive cyclic codes with their applications
• Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)

This page was built for publication: On the parameters of extended primitive cyclic codes and the related designs

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