Geodesic
Repetition-free decomposition of strongly dependent functions
Diskretnaya Matematika, Tome 16 (2004) no. 3, pp. 3-42

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

Some results on decomposition of boolean functions are generalised to the case of discrete $k$-valued functions. Autotopy and isostrophy groups and parameters of functions with non-trivial decompositions are considered. 
@article{DM_2004_16_3_a0,
     author = {A. V. Cheremushkin},
     title = {Repetition-free decomposition of strongly dependent functions},
     journal = {Diskretnaya Matematika},
     pages = {3--42},
     publisher = {mathdoc},
     volume = {16},
     number = {3},
     year = {2004},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2004_16_3_a0/}
}
TY  - JOUR
AU  - A. V. Cheremushkin
TI  - Repetition-free decomposition of strongly dependent functions
JO  - Diskretnaya Matematika
PY  - 2004
SP  - 3
EP  - 42
VL  - 16
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2004_16_3_a0/
LA  - ru
ID  - DM_2004_16_3_a0
ER  - 
%0 Journal Article
%A A. V. Cheremushkin
%T Repetition-free decomposition of strongly dependent functions
%J Diskretnaya Matematika
%D 2004
%P 3-42
%V 16
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2004_16_3_a0/
%G ru
%F DM_2004_16_3_a0
A. V. Cheremushkin. Repetition-free decomposition of strongly dependent functions. Diskretnaya Matematika, Tome 16 (2004) no. 3, pp. 3-42. http://geodesic.mathdoc.fr/item/DM_2004_16_3_a0/