2005/02/04 by Sergey Agievich · 1 citation
Mathematics · #math.CO #msc:05B20 #msc:06E30 #msc:11T71 #msc:94A60
published as Probabilistic Methods in Discrete Mathematics: Proceedings of the Fifth International Petrozavodsk Conference (Petrozavodsk, June 1-6, 2000). Utrecht, Boston: VSP, pp.121-135, 2002 · 14 pages
arxiv created 2005/02/04 · arxiv updated 2009/12/01
We propose a representation of boolean bent functions by bent rectangles, that is, by special matrices with restrictions on rows and columns. Using this representation, we exhibit new classes of bent functions, give an algorithm to construct bent functions, improve a lower bound for the number of bent functions.