Some 3-designs and shortened codes from binary cyclic codes with three zeros

DOI10.1016/J.FFA.2023.102201MaRDI QIDQ6156911zbMATH OpenFDO

Authors Can Xiang, Chun-Ming Tang

Publication date 19 June 2023

Published in Finite Fields and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

\(t\)-designslinear codecyclic codeshortened code

Mathematics Subject Classification ID

Blocking sets, ovals, (k)-arcs (51E21) Linear codes (general theory) (94B05) Linear codes and caps in Galois spaces (51E22)

Abstract: Linear codes and $t$-designs are interactive with each other. It is well known that some $t$-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended codes of linear codes holding an infinite family of $t$-designs with $tgeq3$ are reported in the literature. In this paper, we study the extended codes of the augmented codes of a class of binary cyclic codes with three zeros and their dual codes, and show that those codes hold $3$-designs. Furthermore, we obtain some shortened codes from the studied cyclic codes and explicitly determine their parameters. Some of those shortened codes are optimal or almost optimal.

Recommendations

• Infinite families of 2-designs and 3-designs from linear codes
• Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
• Infinite families of 3-designs from a type of five-weight code
• Linear codes from support designs of ternary cyclic codes
• Some \(t\)-designs from BCH codes

Cites work

• scientific article; zbMATH DE number 1284428 (Why is no real title available?)
• A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
• A Family of $m$-Sequences With Five-Valued Cross Correlation
• A construction of binary linear codes from Boolean functions
• A family of optimal ternary cyclic codes from the Niho-type exponent
• A sequence construction of cyclic codes over finite fields
• An Infinite Family of Linear Codes Supporting 4-Designs
• An Infinite Family of Steiner Systems from Cyclic Codes
• Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
• Combinatorial \(t\)-designs from special functions
• Constructions of Self-Orthogonal Codes From Hulls of BCH Codes and Their Parameters
• Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codes
• Designs from linear codes
• Fundamentals of Error-Correcting Codes
• Infinite families of 3-designs from a type of five-weight code
• Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
• Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
• Linear codes with few weights from weakly regular bent functions based on a generic construction
• On Infinite Families of Narrow-Sense Antiprimitive BCH Codes Admitting 3-Transitive Automorphism Groups and Their Consequences
• On decoding BCH codes
• Optimal Ternary Cyclic Codes From Monomials
• Several Classes of Minimal Linear Codes With Few Weights From Weakly Regular Plateaued Functions
• Shortened Linear Codes From APN and PN Functions
• Shortened Linear Codes Over Finite Fields
• Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
• The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
• The subfield codes of several classes of linear codes
• \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))

Cited in

(1)

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

This page was built for publication: Some 3-designs and shortened codes from binary cyclic codes with three zeros

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