Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
From MaRDI portal
(Redirected from Publication:825932)
Abstract: Combinatorial -designs have been an important research subject for many years, as they have wide applications in coding theory, cryptography, communications and statistics. The interplay between coding theory and -designs has been attracted a lot of attention for both directions. It is well known that a linear code over any finite field can be derived from the incidence matrix of a -design, meanwhile, that the supports of all codewords with a fixed weight in a code also may hold a -design. In this paper, by determining the weight distribution of a class of linear codes derived from non-binary Kasami cyclic codes, we obtain infinite families of -designs from the supports of all codewords with a fixed weight in these codes, and calculate their parameters explicitly.
Recommendations
- Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
- Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\)
- Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
- Infinite families of 2-designs and 3-designs from linear codes
- Infinite families of 3-designs from a type of five-weight code
Cites work
- scientific article; zbMATH DE number 47996 (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?)
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Coding and Combinatorics
- Complex sequences over GF(p/sup M/) with a two-level autocorrelation function and a large linear span
- Designs from linear codes
- Hasse-Davenport curves, Gauss sums, and weight distributions of irreducible cyclic codes
- Infinite families of 2-designs and 3-designs from linear codes
- Infinite families of 2‐designs from a class of cyclic 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
- Sums of Gauss sums and weights of irreducible codes
Cited in
(13)- Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
- 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
- Linear codes from support designs of ternary cyclic codes
- Linear codes of 2-designs as subcodes of the generalized Reed-Muller codes
- New infinite series of 2-designs over the binary and ternary field
- 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
- A class of affine-invariant codes and their support 2-designs
- Infinite families of 2‐designs from a class of cyclic codes
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\)
- Infinite families of 2‐designs derived from affine‐invariant codes
- An infinite family of non-embeddable Hadamard designs
This page was built for publication: Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q825932)