Infinite families of t-designs from the binomial x^4 +x^3 over GF(2ⁿ)
From MaRDI portal
Publication:6157857
Recommendations
- Some infinite families of large sets of \(t\)-designs
- Some infinite families of 2-designs from \(PG(n,q)\)
- scientific article; zbMATH DE number 5054200
- An infinite family of 3-designs from Preparata codes over \(\mathbb{Z}_4\)
- New infinite families of 3-designs from Preparata codes over \(\mathbb{Z}_4\)
- scientific article; zbMATH DE number 91012
- Infinite families of 3-designs from o-polynomials
- New infinite families of 3-designs from algebraic curves over \(\mathbb F_q\)
- Two new infinite families of 3-designs from Kerdock codes over Z₄.
- Infinite families of 2- and 3-designs with parameters v = p + 1, k = (p ? 1)/2i + 1, where p odd prime, 2e T (p ? 1), e ? 2, 1 ? i ? e
Cites work
- A coding theoretic approach to extending designs
- Codes, Differentially \delta -Uniform Functions, and t -Designs
- Combinatorial \(t\)-designs from quadratic functions
- Combinatorial \(t\)-designs from special functions
- Designs in additive codes over GF(4)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1382770 (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
- Infinite families of 3‐designs from APN functions
- Linear Codes From Some 2-Designs
- On \(x^{q+1}+ax+b\)
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- Steiner systems \(S(2,4,v)\) -- a survey
Cited in
(11)- Construction of 2-designs
- Some infinite families of large sets of \(t\)-designs
- Infinite families of 2-designs and 3-designs from linear codes
- Combinatorial \(t\)-designs from special functions
- Combinatorial \(t\)-designs from quadratic functions
- On \(t\)-designs from codes over \(\mathbb{Z}_4\)
- Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions
- Infinite families of 3‐designs from APN functions
- Infinite families of 3-designs from special symmetric polynomials
- Infinite families of 3-designs from o-polynomials
- Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
This page was built for publication: Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157857)
