|
Sibirskii Zhurnal Vychislitel'noi Matematiki, 2003, Volume 6, Number 2, Pages 101–111
(Mi sjvm179)
|
|
|
|
Enumeration, coding, and generation of sequences with constraints on lengths of minimum series
V. A. Amelkin Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences
Abstract:
The sets of binary and $n$-valued serial sequences of the length $m$ with the given values of lengths of
minimum series are considered. Exact formulas for the determination of the powers of such sets are obtained.
The algorithms of coding and generation for the binary sequences are found.
Received: 30.04.2002
Citation:
V. A. Amelkin, “Enumeration, coding, and generation of sequences with constraints on lengths of minimum series”, Sib. Zh. Vychisl. Mat., 6:2 (2003), 101–111
Linking options:
https://www.mathnet.ru/eng/sjvm179 https://www.mathnet.ru/eng/sjvm/v6/i2/p101
|
Statistics & downloads: |
Abstract page: | 215 | Full-text PDF : | 94 | References: | 30 |
|