Bent Rectangles
From MaRDI portal
Publication:3597512
Abstract: We study generalized regular bent functions using a representation by bent rectangles, that is, special matrices with restrictions on rows and columns. We describe affine transformations of bent rectangles, propose new biaffine and bilinear constructions, study partitions of a vector space into affine planes of the same dimension and use such partitions to build bent rectangles. We illustrate the concept of bent rectangles by examples for the Boolean case.
Recommendations
Cited in
(7)- An asymptotic lower bound on the number of bent functions
- scientific article; zbMATH DE number 7656038 (Why is no real title available?)
- Upper bounding the number of bent functions using 2-row bent rectangles
- Irreducible subcube partitions
- scientific article; zbMATH DE number 7300318 (Why is no real title available?)
- An upper bound on binomial coefficients in the de Moivre-Laplace form
- The bounds on the number of partitions of the space \(\mathbb{F}_2^m\) into \(k\)-dimensional affine subspaces
This page was built for publication: Bent Rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597512)