Geodesic
On additivity and affinity coefficients of discrete functions
Diskretnaya Matematika, Tome 24 (2012) no. 1, pp. 30-47.

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

@article{DM_2012_24_1_a2,
     author = {M. M. Glukhov and P. N. Zakrevskii},
     title = {On additivity and affinity coefficients of discrete functions},
     journal = {Diskretnaya Matematika},
     pages = {30--47},
     publisher = {mathdoc},
     volume = {24},
     number = {1},
     year = {2012},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2012_24_1_a2/}
}
TY  - JOUR
AU  - M. M. Glukhov
AU  - P. N. Zakrevskii
TI  - On additivity and affinity coefficients of discrete functions
JO  - Diskretnaya Matematika
PY  - 2012
SP  - 30
EP  - 47
VL  - 24
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2012_24_1_a2/
LA  - ru
ID  - DM_2012_24_1_a2
ER  - 
%0 Journal Article
%A M. M. Glukhov
%A P. N. Zakrevskii
%T On additivity and affinity coefficients of discrete functions
%J Diskretnaya Matematika
%D 2012
%P 30-47
%V 24
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2012_24_1_a2/
%G ru
%F DM_2012_24_1_a2
M. M. Glukhov; P. N. Zakrevskii. On additivity and affinity coefficients of discrete functions. Diskretnaya Matematika, Tome 24 (2012) no. 1, pp. 30-47. http://geodesic.mathdoc.fr/item/DM_2012_24_1_a2/

[1] Ambrosimov A. S., “Svoistva bent-funktsii $q$-znachnoi logiki nad konechnymi polyami”, Diskretnaya matematika, 6:3 (1994), 50–60 | MR | Zbl

[2] Gorshkov S. P., “Primenenie teorii $NP$-polnykh zadach dlya otsenki slozhnosti resheniya sistem bulevykh uravnenii”, Obozrenie prikladnoi i promyshlennoi matematiki, 2 (1995), 325–399

[3] Logachev O. A., Salnikov A. A., Yaschenko V. V., Bulevy funktsii v teorii kodirovaniya i kriptologii, MTsNMO, Moskva, 2004

[4] Solodovnikov V. I., “Bent-funktsii iz konechnoi abelevoi gruppy v konechnuyu abelevu gruppu”, Diskretnaya matematika, 14:1 (2002), 99–113 | MR | Zbl

[5] Bellare M., Goldwasser S., Lund C., Russell A., “Efficient probabilistic checkable proofs and applications to approximation”, Proc. STOC' 94, ACM, New York, 1994, 820 | DOI

[6] Bellare M., Coppersmith D., Hastad J., Kiwi M., Sudan M., “Linearity testing in characteristic two”, IEEE Trans. Inform. Theory, 42 (1996), 1781–1795 | DOI | MR | Zbl

[7] Blum M., Luby M., Rubinfeld R., “Self-testings/correcting with applications to numerical problems”, J. Comput. Syst. Sci., 47 (1993), 549–595 | DOI | MR | Zbl

[8] Golomb S. W., “On classification of Boolean functions”, IRE Trans. Circuit Theory, 6 (1959), 176–186

[9] Kaufman T., Litsyn S., Xie N., “Breaking the $\epsilon$-soundness bound of the linearity test over $\mathit{GF}(2)$”, SIAM J. Comput., 39 (2010), 1998–2003 | DOI | MR