Applying a Generalized Allocation Scheme to Analyzing a Class of Sequences Generated by a Shift Register
- Authors: Kolchin A.V.1, Bezrodnyy B.F.1, Leeva M.A.1
-
Affiliations:
- Moscow Automobile and Road Construction State Technical University (MADI)
- Issue: Vol 43, No 1 (2019)
- Pages: 12-16
- Section: Article
- URL: https://journals.rcsi.science/0278-6419/article/view/176273
- DOI: https://doi.org/10.3103/S0278641919010035
- ID: 176273
Cite item
Abstract
An example of applying a generalized allocation scheme to studying the asymptotic behavior of combinatorial objects is considered. The allocation of tuples of zeros and ones onto a circle generated by a shift register under certain conditions is analyzed.
About the authors
A. V. Kolchin
Moscow Automobile and Road Construction State Technical University (MADI)
Author for correspondence.
Email: akolchin@madi.ru
Russian Federation, Moscow, 125319
B. F. Bezrodnyy
Moscow Automobile and Road Construction State Technical University (MADI)
Author for correspondence.
Email: boris-bezrodny@yandex.ru
Russian Federation, Moscow, 125319
M. A. Leeva
Moscow Automobile and Road Construction State Technical University (MADI)
Author for correspondence.
Email: leevam@mail.ru
Russian Federation, Moscow, 125319
Supplementary files
