|
Sibirskii Zhurnal Vychislitel'noi Matematiki, 2002, Volume 5, Number 3, Pages 215–223
(Mi sjvm250)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Algorithms for enumeration and numeration coding of sequences with specified lengths of maximal series
V. A. Amelkin Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences
Abstract:
Sets of binary and n-valued sequences of length m with specified limitations on lengths of maximal series are considered. Exact formulas for the determination of powers of such sets have been obtained. Algorithms of numeration coding and generation for binary sequences have been obtained.
Received: 26.02.2001
Citation:
V. A. Amelkin, “Algorithms for enumeration and numeration coding of sequences with specified lengths of maximal series”, Sib. Zh. Vychisl. Mat., 5:3 (2002), 215–223
Linking options:
https://www.mathnet.ru/eng/sjvm250 https://www.mathnet.ru/eng/sjvm/v5/i3/p215
|
Statistics & downloads: |
Abstract page: | 403 | Full-text PDF : | 151 | References: | 79 |
|