Infinite families of 2-designs and 3-designs from linear codes

DOI10.1016/J.DISC.2017.05.013MaRDI QIDQ2012529zbMATH OpenOpenAlexFDO

Authors Cunsheng Ding, Chengju Li

Publication date 1 August 2017

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

\(t\)-designlinear codecyclic codedifference family

Mathematics Subject Classification ID

Other designs, configurations (05B30) Linear codes (general theory) (94B05)

Abstract: The interplay between coding theory and $t$-designs started many years ago. While every $t$-design yields a linear code over every finite field, the largest $t$ for which an infinite family of $t$-designs is derived directly from a linear or nonlinear code is $t=3$. Sporadic $4$-designs and $5$-designs were derived from some linear codes of certain parameters. The major objective of this paper is to construct many infinite families of $2$-designs and $3$-designs from linear codes. The parameters of some known $t$-designs are also derived. In addition, many conjectured infinite families of $2$-designs are also presented.

Recommendations

• Infinite families of 3-designs from a type of five-weight code
• Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
• Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
• Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
• Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\)

Cites work

• scientific article; zbMATH DE number 53917 (Why is no real title available?)
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1250549 (Why is no real title available?)
• scientific article; zbMATH DE number 1284428 (Why is no real title available?)
• scientific article; zbMATH DE number 1382770 (Why is no real title available?)
• Coding and Combinatorics
• Fundamentals of Error-Correcting Codes
• Hamming weights in irreducible cyclic codes
• Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
• Narrow-Sense BCH Codes Over $ {\mathrm {GF}}(q)$ With Length $n=\frac {q^{m}-1}{q-1}$
• New 5-designs
• On the weight enumeration of weights less than 2.5d of Reed—Muller codes
• On the weight structure of Reed-Muller codes
• Steiner systems \(S(2,4,v)\) -- a survey
• The Existence and Construction of Balanced Incomplete Block Designs
• The dimension and minimum distance of two classes of primitive BCH codes
• The weight distribution of a class of linear codes from perfect nonlinear functions
• Three-weight cyclic codes and their weight distributions

Cited in

(38)

• Infinite families of 3-designs from o-polynomials
• Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
• Periodical burst error correcting codes with decoding error probability
• Infinite families of 3‐designs from APN functions
• Infinite families of 2‐designs from a class of cyclic codes
• An Assmus-Mattson theorem for rank metric codes
• Three classes of BCH codes and their duals
• AG codes, \(t\)-designs and partition sets
• New infinite families of near MDS codes holding \(t\)-designs
• Parameters of 2-designs from some BCH codes
• Some 3-designs and shortened codes from binary cyclic codes with three zeros
• A class of affine-invariant codes and their support 2-designs
• An infinite family of non-embeddable Hadamard designs
• Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
• Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\)
• Infinite families of 3-designs from a type of five-weight code
• Some \(t\)-designs from BCH codes
• Two new infinite families of 3-designs from Kerdock codes over \(\mathbb Z_4\).
• Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
• Combinatorial \(t\)-designs from special functions
• Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
• Combinatorial \(t\)-designs from quadratic functions
• Weighted subspace designs from \(q\)-polymatroids
• Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
• Combinatorial \(t\)-designs and strongly regular graphs from projective codes over finite fields
• Linear codes from support designs of ternary cyclic codes
• Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
• Infinite families of 2-designs from a class of affine-invariant codes
• Constructions of cyclic codes and extended primitive cyclic codes with their applications
• Infinite families of 2‐designs derived from affine‐invariant codes
• An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
• Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
• On \(t\)-designs from codes over \(\mathbb{Z}_4\)
• Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
• Infinite families of 3-designs from special symmetric polynomials
• Infinite families of 2-designs from linear codes
• Unit \(\mathbb{Z}_q\)-simplex codes of type \(\alpha\) and zero divisor \(\mathbb{Z}_q\)-simplex codes
• Infinite families of \(t\)-designs and strongly regular graphs from punctured codes

This page was built for publication: Infinite families of 2-designs and 3-designs from linear codes

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