Geodesic
Binomial linear complexity of polylinear sequences
Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 6 (2002), pp. 82-138 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

@article{TDM_2002_6_a5,
     author = {V. L. Kurakin},
     title = {Binomial linear complexity of polylinear sequences},
     journal = {Trudy po diskretnoj matematike},
     pages = {82--138},
     year = {2002},
     volume = {6},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TDM_2002_6_a5/}
}
TY  - JOUR
AU  - V. L. Kurakin
TI  - Binomial linear complexity of polylinear sequences
JO  - Trudy po diskretnoj matematike
PY  - 2002
SP  - 82
EP  - 138
VL  - 6
UR  - http://geodesic.mathdoc.fr/item/TDM_2002_6_a5/
LA  - ru
ID  - TDM_2002_6_a5
ER  - 
%0 Journal Article
%A V. L. Kurakin
%T Binomial linear complexity of polylinear sequences
%J Trudy po diskretnoj matematike
%D 2002
%P 82-138
%V 6
%U http://geodesic.mathdoc.fr/item/TDM_2002_6_a5/
%G ru
%F TDM_2002_6_a5
V. L. Kurakin. Binomial linear complexity of polylinear sequences. Trudy po diskretnoj matematike, Trudy po Diskretnoi Matematike, Tome 6 (2002), pp. 82-138. http://geodesic.mathdoc.fr/item/TDM_2002_6_a5/