Geodesic
Estimating the level of affinity of a quadratic form
Diskretnaya Matematika, Tome 29 (2017) no. 1, pp. 114-125.

Voir la notice de l'article provenant de la source Math-Net.Ru

The level of affinity of a Boolean function is defined as the minimum number of variables such that assigning any particular values to these variables makes the function affine. The generalized level of affinity is defined as the minimum number of linear combinations of variables the values of which may be specified in such a way that the function becomes affine. For a quadratic form of rank $2r$ the generalized level of affinity is equal to $r$. We present some properties of the distribution of the rank of the random quadratic form and, as a corollary, derive an asymptotic estimate for the generalized level of affinity of quadratic forms.
Keywords: Boolean functions, quadratic forms, level of affinity. 
@article{DM_2017_29_1_a8,
     author = {A. V. Cheremushkin},
     title = {Estimating the level of affinity of a quadratic form},
     journal = {Diskretnaya Matematika},
     pages = {114--125},
     publisher = {mathdoc},
     volume = {29},
     number = {1},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2017_29_1_a8/}
}
TY  - JOUR
AU  - A. V. Cheremushkin
TI  - Estimating the level of affinity of a quadratic form
JO  - Diskretnaya Matematika
PY  - 2017
SP  - 114
EP  - 125
VL  - 29
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2017_29_1_a8/
LA  - ru
ID  - DM_2017_29_1_a8
ER  - 
%0 Journal Article
%A A. V. Cheremushkin
%T Estimating the level of affinity of a quadratic form
%J Diskretnaya Matematika
%D 2017
%P 114-125
%V 29
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2017_29_1_a8/
%G ru
%F DM_2017_29_1_a8
A. V. Cheremushkin. Estimating the level of affinity of a quadratic form. Diskretnaya Matematika, Tome 29 (2017) no. 1, pp. 114-125. http://geodesic.mathdoc.fr/item/DM_2017_29_1_a8/

[1] Dixon L. E., Linear groups with an expositions of the Galois field theory, B. J. Teubner, Leipzig, 1901, 312 pp.

[2] Dieudonné J., La géométrie des groupes classiques, Springer-Verlag, Berlin, 1955 | MR | MR

[3] MacWilliams E. J., Sloane N. J. A., The Theory of Error-Correcting Codes, v. I, II, North-Holland, Amsterdam, 1977 | MR | Zbl

[4] Ryazanov B. V., Checheta S. I., “On the approximation of a random Boolean function by the set of quadratic forms”, Discrete Math. Appl., 5:5 (1995), 473–489 | DOI | MR | Zbl

[5] Buryakov M. L., “Asymptotic bounds for the affinity level for almost all Boolean functions”, Discrete Math. Appl., 18:5 (2008), 545–551 | DOI | DOI | MR | MR | Zbl