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

A. V. Kolchin; B. F. Bezrodnyy; M. A. Leeva

doi:10.3103/S0278641919010035

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

作者: Kolchin A.V.¹, Bezrodnyy B.F.¹, Leeva M.A.¹
隶属关系:
1. Moscow Automobile and Road Construction State Technical University (MADI)
期: 卷 43, 编号 1 (2019)
页面: 12-16
栏目: Article
URL: https://journals.rcsi.science/0278-6419/article/view/176273
DOI: https://doi.org/10.3103/S0278641919010035
ID: 176273

如何引用文章

全文:

开放存取

##reader.subscriptionAccessGranted##
受限制的访问

订阅存取

详细
作者简介
参考
补充文件
统计

详细

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.