Infinite families of 3‐designs from APN functions
From MaRDI portal
Publication:6185552
DOI10.1002/jcd.21685arXiv1904.04071OpenAlexW2987248294WikidataQ126826589 ScholiaQ126826589MaRDI QIDQ6185552
No author found.
Publication date: 29 January 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.04071
Combinatorial aspects of block designs (05B05) Linear codes (general theory) (94B05) Blocking sets, ovals, (k)-arcs (51E21) Special polynomials in general fields (12E10)
Related Items
Infinite families of 3-designs from o-polynomials ⋮ Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\) ⋮ The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\) ⋮ Combinatorial \(t\)-designs from quadratic functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On \(x^{q+1}+ax+b\)
- New cyclic difference sets with Singer parameters
- On Dillon's class \(H\) of bent functions, Niho bent functions and o-polynomials
- A family of skew Hadamard difference sets
- A new family of 4-designs
- Multiplicative difference sets via additive characters
- Infinite families of 2-designs and 3-designs from linear codes
- \(X^{2^l+1}+x+a\) and related affine polynomials over \(\mathrm{GF}(2^k\))
- On the equation \(x^{2^l+1}+x+a=0\) over \(\mathrm{GF}(2^k)\)
- Bent Functions
- On the solution of algebraic equations over finite fields