Applying a Generalized Allocation Scheme to Analyzing a Class of Sequences Generated by a Shift Register


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

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

Supplementary Files
Action
1. JATS XML

Copyright (c) 2019 Allerton Press, Inc.