Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
From MaRDI portal
Publication:6169864
Abstract: Due to their important applications to coding theory, cryptography, communications and statistics, combinatorial -designs have been attracted lots of research interest for decades. The interplay between coding theory and -designs has on going for many years. As we all known, -designs can be used to derive linear codes over any finite field, as well as the supports of all codewords with a fixed weight in a code also may hold a -design. In this paper, we first construct a class of linear codes from cyclic codes related to Dembowski-Ostrom functions. By using exponential sums, we then determine the weight distribution of the linear codes. Finally, we obtain infinite families of -designs from the supports of all codewords with a fixed weight in these codes. Furthermore, the parameters of -designs are calculated explicitly.
Recommendations
- Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
- Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
- Infinite families of 2-designs and 3-designs from linear codes
- 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
Cites work
- scientific article; zbMATH DE number 47996 (Why is no real title available?)
- 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 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
- A coding theoretic approach to extending designs
- Designs in additive codes over GF(4)
- Fundamentals of Error-Correcting 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 two classes of binary cyclic codes with three nonzeros
- Infinite families of 3-designs from a type of five-weight code
- Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes
- Linear codes with few weights from inhomogeneous quadratic functions
- 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
- The weight distributions of a class of cyclic codes
Cited in
(10)- Infinite Families of 3-Designs and 2-Designs From Almost MDS Codes
- Combinatorial \(t\)-designs from special functions
- Infinite families of 2-designs and 3-designs from linear codes
- Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
- Infinite families of 2-designs from a class of affine-invariant codes
- Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
- Combinatorial \(t\)-designs from quadratic 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
This page was built for publication: Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169864)