Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Prikladnaya Diskretnaya Matematika, 2014, Number 3(25), Pages 28–39 (Mi pdm466)  

This article is cited in 14 scientific papers (total in 14 papers)

Theoretical Foundations of Applied Discrete Mathematics

An upper bound for the number of bent functions at the distance $2^k$ from an arbitrary bent function in $2k$ variables

N. A. Kolomeec

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
References:
Abstract: An upper bound for the number of bent functions at the distance $2^k$ from an arbitrary bent function in $2k$ variables is obtained. The bound is reached only for quadratic bent functions. A notion of completely affine decomposable Boolean function is introduced. It is proved that only affine and quadratic Boolean functions can be completely affine decomposable.
Keywords: Boolean functions, bent functions, quadratic bent functions.
Document Type: Article
UDC: 519.7
Language: Russian
Citation: N. A. Kolomeec, “An upper bound for the number of bent functions at the distance $2^k$ from an arbitrary bent function in $2k$ variables”, Prikl. Diskr. Mat., 2014, no. 3(25), 28–39
Citation in format AMSBIB
\Bibitem{Kol14}
\by N.~A.~Kolomeec
\paper An upper bound for the number of bent functions at the distance $2^k$ from an arbitrary bent function in $2k$ variables
\jour Prikl. Diskr. Mat.
\yr 2014
\issue 3(25)
\pages 28--39
\mathnet{http://mi.mathnet.ru/pdm466}
Linking options:
  • https://www.mathnet.ru/eng/pdm466
  • https://www.mathnet.ru/eng/pdm/y2014/i3/p28
  • This publication is cited in the following 14 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Прикладная дискретная математика
    Statistics & downloads:
    Abstract page:356
    Full-text PDF :153
    References:78
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024