Geodesic
Algorithms for exact solving the problems of enumeration, coding, and generation of serial sequences
Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 4 (2001) no. 1, pp. 1-12 
V. A. Amelkin. Algorithms for exact solving the problems of enumeration, coding, and generation of serial sequences. Sibirskij žurnal vyčislitelʹnoj matematiki, Tome 4 (2001) no. 1, pp. 1-12. http://geodesic.mathdoc.fr/item/SJVM_2001_4_1_a0/
@article{SJVM_2001_4_1_a0,
     author = {V. A. Amelkin},
     title = {Algorithms for exact solving the problems of enumeration, coding, and generation of serial sequences},
     journal = {Sibirskij \v{z}urnal vy\v{c}islitelʹnoj matematiki},
     pages = {1--12},
     year = {2001},
     volume = {4},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/SJVM_2001_4_1_a0/}
}
TY  - JOUR
AU  - V. A. Amelkin
TI  - Algorithms for exact solving the problems of enumeration, coding, and generation of serial sequences
JO  - Sibirskij žurnal vyčislitelʹnoj matematiki
PY  - 2001
SP  - 1
EP  - 12
VL  - 4
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/SJVM_2001_4_1_a0/
LA  - ru
ID  - SJVM_2001_4_1_a0
ER  - 
%0 Journal Article
%A V. A. Amelkin
%T Algorithms for exact solving the problems of enumeration, coding, and generation of serial sequences
%J Sibirskij žurnal vyčislitelʹnoj matematiki
%D 2001
%P 1-12
%V 4
%N 1
%U http://geodesic.mathdoc.fr/item/SJVM_2001_4_1_a0/
%G ru
%F SJVM_2001_4_1_a0

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

Binary and any serial sequences of a specified structure are considered. For some basic types of these sequences, generalized formulas for exact solving enumerative problems without resort to generating functions are obtained. A generalized algorithm of coding and generation of the binary serial sequences with structures determined by limitations on the number of series of unities, on the weight of the sequence, on the lengths of series of unities, and on the lengths of series of zeros is proposed.

[1] Goncharov V. L., “Iz oblasti kombinatoriki”, Izvestiya AN SSSR. Seriya matem., 8:1 (1944), 3–48

[2] Trunov A. N., “Predelnye teoremy v zadache o razmeschenii odinakovykh chastits po razlichnym yacheikam”, Veroyatnostnye zadachi diskretnoi matematiki, Sb. statei. Trudy MIAN SSSR, 177, Nauka, M., 1986, 147–164 | MR

[3] Korshunov A. D., “Ob asimptotike chisla binarnykh slov s zadannoi dlinoi maksimalnoi serii”, Diskretnyi analiz i issledovanie operatsii. Seriya 1, 4 (1997), 13–46 | MR | Zbl

[4] Kostochka A. V., Mazurov V. D., Savelev L. Ya., “Chislo $q$-ichnykh slov s ogranicheniyami na dlinu maksimalnoi serii”, Diskretnaya matematika, 10:1 (1998), 10–19

[5] Vasilev P. I., “O blokakh s ogranichennymi dlinami serii s nakoplennoi summoi”, Tez. dokl. 9 vsesoyuznoi konferentsii “Teoriya kodirovaniya i peredacha informatsii”. Ch. 1 (Odessa, 1988), 281–284

[6] Amelkin V.A., Algoritmy numeratsii posledovatelnostei, sostavlennykh iz serii, AN SSSR. Sib. otd-nie. VTs, Novosibirsk, 1990 | MR

[7] Amelkin V. A., Perechislitelnye zadachi seriinykh posledovatelnostei, Preprint / RAN. Sib. otd-nie. VTs; 1056, Novosibirsk, 1995 | MR

[8] Carlitz L., “Fibonacci notes. Zero one sequences and Fibonacci numbers of higlier order”, Fibonacci Quorty, 12:1 (1979), 1–10

[9] Stakhov A. P., Vvedenie v algoritmicheskuyu teoriyu izmereniya, Sov. radio, M., 1977 | MR | Zbl

[10] Savelev L. Ya., “Maksimum dlin serii v obobschennykh posledovatelnostyakh Bernulli”, Diskretnaya matematika, 11:1 (1999), 29–52 | MR

[11] Amelkin V. A., Metody numeratsionnogo kodirovaniya, Nauka, Novosibirsk, 1986 | MR

[12] Ryabko B. Ya., “Bystraya numeratsiya kombinatornykh ob'ektov”, Diskretnaya matematika, 10:2 (1998), 101–119 | MR | Zbl