Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
From MaRDI portal
(Redirected from Publication:2070264)
Abstract: Combinatorial -designs have been an interesting topic in combinatorics for decades. It is a basic fact that the codewords of a fixed weight in a code may hold a -design. Till now only a small amount of work on constructing -designs from codes has been done. In this paper, we determine the weight distributions of two classes of cyclic codes: one related to the triple-error correcting binary BCH codes, and the other related to the cyclic codes with parameters satisfying the generalized Kasami case, respectively. We then obtain infinite families of -designs from these codes by proving that they are both affine-invariant codes, and explicitly determine their parameters. In particular, the codes derived from the dual of binary BCH codes hold five -designs when .
Combinatorial \(t\)-designs have been investigated for many decades. It is well known that the codewords of a fixed weight in a code may hold a \(t\)-design. In this paper, the authors determine the weight distributions of two classes of cyclic codes: one related to the triple-error correcting binary BCH codes, and the other related to the cyclic codes with parameters satisfying the generalized Kasami case, respectively. Infinite families of 2-designs are obtained from these codes by proving that they are both affine-invariant codes, and explicitly determine their parameters. In particular, the codes derived from the dual of binary BCH codes hold five 3-designs.
Recommendations
- Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
- Infinite families of 2-designs and 3-designs from linear codes
- Infinite families of 2-designs from linear codes
- Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
- Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
- Infinite families of 3-designs from a type of five-weight code
- Five infinite families of binary cyclic codes and their related codes with good parameters
- Two new infinite families of 3-designs from Kerdock codes over Z₄.
- Infinite Families of Linear Codes Supporting More t-Designs
- Two infinite families of two-weight codes over \(\mathbb{Z}_{2^{m}}\)
Cites work
- A coding theoretic approach to extending designs
- Cyclic Codes and Sequences: The Generalized Kasami Case
- Designs from linear codes
- Designs in additive codes over GF(4)
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1284428 (Why is no real title available?)
- Infinite families of 2-designs and 3-designs from linear codes
- Infinite families of 3-designs from a type of five-weight code
- New 5-designs
- Some results on cyclic codes which are invariant under the affine group and their applications
- Steiner systems \(S(2,4,v)\) -- a survey
- The CRC handbook of combinatorial designs
Cited in
(28)- Two new infinite families of 3-designs from Kerdock codes over Z₄.
- Infinite families of 2-designs and 3-designs from linear codes
- Linear codes from support designs of ternary cyclic codes
- Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
- A class of affine-invariant codes and their support 2-designs
- Combinatorial \(t\)-designs from quadratic functions
- Infinite families of 3-designs from a type of five-weight code
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
- Some t-designs from BCH codes
- New infinite series of 2-designs over the binary and ternary field
- Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
- Parameters of 2-designs from some BCH codes
- Infinite families of 2-designs from a class of affine-invariant codes
- Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
- Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
- Infinite families of 2‐designs derived from affine‐invariant codes
- Some 3-designs and shortened codes from binary cyclic codes with three zeros
- Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
- New infinite families of near MDS codes holding \(t\)-designs
- Infinite families of 2‐designs from a class of cyclic codes
- On the parameters of extended primitive cyclic codes and the related designs
- Infinite families of 3-designs from special symmetric polynomials
- An infinite family of AMDS codes holding 2-designs
- A class of affine-invariant codes and their related codes
- Constructions of t-designs from the Gold function
- Combinatorial t-designs from the second minimum weight codewords
- Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
This page was built for publication: Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2070264)
