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. Suppl., 2014, no. 7, 22

Prikladnaya Diskretnaya Matematika. Supplement

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

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

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

Prikladnaya Diskretnaya Matematika. Supplement, 2014, Issue 7, Pages 22–24 (Mi pdma155)

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

Full-text PDF (572 kB)

References:

PDF

HTML

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. The notion of completely affine decomposable Boolean function is introduced. It is proven 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. Suppl., 2014, no. 7, 22–24

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. Suppl.

\yr 2014

\issue 7

\pages 22--24

\mathnet{http://mi.mathnet.ru/pdma155}

Linking options:

https://www.mathnet.ru/eng/pdma155

https://www.mathnet.ru/eng/pdma/y2014/i7/p22

Cycle of papers

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
Prikl. Diskr. Mat. Suppl., 2014:7, 22–24
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
Prikl. Diskr. Mat., 2014:3(25), 28–39

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Prikladnaya Diskretnaya Matematika. Supplement

Statistics & downloads:
Abstract page:	150
Full-text PDF :	81
References:	29

Что такое QR-код?

Registration to the website

Logotypes