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

Sib. Zh. Vychisl. Mat., 2001 Volume 4, Number 1, Pages 1–12 (Mi sjvm380)

This article is cited in 4 papers

Algorithms for exact solving the problems of enumeration, coding, and generation of serial sequences

V. A. Amelkin

Institute of Computational Mathematics and Mathematical Geophysics (Computing Center), Siberian Branch of the Russian Academy of Sciences

Abstract: 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.

UDC: 519.1

Received: 11.04.2000
Revised: 19.07.2000



Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026