Combinatorial \(t\)-designs from special functions
From MaRDI portal
Publication:2040310
DOI10.1007/s12095-020-00442-2zbMath1465.05020OpenAlexW3035926633MaRDI QIDQ2040310
Publication date: 13 July 2021
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-020-00442-2
Combinatorial aspects of block designs (05B05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cyclic codes (94B15) Boolean functions (94D10)
Related Items
Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ Infinite families of 2‐designs derived from affine‐invariant codes ⋮ Some 3-designs and shortened codes from binary cyclic codes with three zeros ⋮ Constructions of cyclic codes and extended primitive cyclic codes with their applications ⋮ Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\) ⋮ New infinite families of near MDS codes holding \(t\)-designs ⋮ Linear codes and incidence structures of bent functions and their generalizations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A construction of binary linear codes from Boolean functions
- On the construction of bent vectorial functions
- On the dimension of an APN code
- Four decades of research on bent functions
- Almost perfect and planar functions
- Exponential numbers of two-weight codes, difference sets and symmetric designs
- Symplectic groups, symmetric designs, and line ovals
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Quasi-symmetric designs, codes, quadrics, and hyperplane sections
- Quasi-symmetric designs and codes meeting the Grey-Rankin bound
- Infinite families of 2-designs and 3-designs from linear codes
- Infinite families of 3-designs from a type of five-weight code
- Optimal Codebooks From Binary Codes Meeting the Levenshtein Bound
- Linear Codes From Some 2-Designs
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- The weight distribution of a class of linear codes from perfect nonlinear functions
- Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications
- Fundamentals of Error-Correcting Codes
- An Infinite Family of Steiner Systems from Cyclic Codes
- Some new three-valued crosscorrelation functions for binary m-sequences
- Weight Divisibility of Cyclic Codes, Highly Nonlinear Functions on F2m, and Crosscorrelation of Maximum-Length Sequences
- Bent Vectorial Functions, Codes and Designs
- Bent Functions
- Some results on cyclic codes which are invariant under the affine group and their applications
- The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Coding and Combinatorics
