Bent Rectangles

DOI10.3233/978-1-58603-878-6-3zbMATH Open1167.94004arXiv0804.0209MaRDI QIDQ3597512FDOQ3597512

Authors: Sergey Agievich 

Publication date: 9 February 2009

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.

Full work available at URL: https://arxiv.org/abs/0804.0209

Recommendations

• Bent partitions
• Publication:4944734
• Generalized bent functions and their properties
• Bent and \(\mathbb{Z}_{2^k}\)-bent functions from spread-like partitions
• An approach to the classification of Boolean bent functions of the nonlinearity degree 3

zbMATH Keywords

bent functionWalsh-Hadamard transformregular bent functionbent rectangledisjoint affine planes

Mathematics Subject Classification ID

Cryptography (94A60) Boolean functions (06E30)

Cited In (7)

• Title not available (Why is that?)
• Upper bounding the number of bent functions using 2-row bent rectangles
• Irreducible subcube partitions
• Title not available (Why is that?)
• 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
• An asymptotic lower bound on the number of bent functions

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)