RUS  ENG
Full version
JOURNALS // Sibirskii Zhurnal Vychislitel'noi Matematiki // Archive

Sib. Zh. Vychisl. Mat., 2002 Volume 5, Number 3, Pages 215–223 (Mi sjvm250)

This article is cited 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.

UDC: 519.1

Received: 26.02.2001



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024