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
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.
@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},
publisher = {mathdoc},
volume = {4},
number = {1},
year = {2001},
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 PB - mathdoc 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 %I mathdoc %U http://geodesic.mathdoc.fr/item/SJVM_2001_4_1_a0/ %G ru %F SJVM_2001_4_1_a0
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/