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

Sib. Zh. Vychisl. Mat., 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.

UDC: 519.1

Received: 30.04.2002



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026