The bounds on the number of partitions of the space \(\mathbb{F}_2^m\) into \(k\)-dimensional affine subspaces

DOI10.3103/S0027132222030044zbMath1498.94111OpenAlexW4293752855MaRDI QIDQ2088737

Yu. V. Tarannikov, I. P. Baksova

Publication date: 6 October 2022

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132222030044

zbMATH Keywords

boundsbent functionsaffine subspacespartitions of a space

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Boolean functions (94D10)

Related Items (2)

An asymptotic lower bound on the number of bent functions ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Four decades of research on bent functions
• Bent Rectangles
• Partitions of V(n, q) into 2‐ and s‐Dimensional Subspaces
• Boolean Functions for Cryptography and Coding Theory
• Bent Functions

This page was built for publication: The bounds on the number of partitions of the space \(\mathbb{F}_2^m\) into \(k\)-dimensional affine subspaces