On the measure of randomness of a binary chain

Recieved: 12/23/2025

Accepted: 05/13/2026

Keywords: binary sequences, measure of sequence randomness

Available in the on-line version with: 15.09.2026

To cite this article

Vinogradov O.P., Shavgulidze E.T. On the measure of randomness of a binary chain. // Moscow University Journal. Series 15. Computational Mathematics and Cybernetics. 2026. N 3, p.31-38 https://doi.org/10.55959/MSU/0137–0782–15–2026–50–3–31–38.

This work is licensed under a Сreative Commons Atribiution - NonCommercial 4.0 International (CC BY-NC 4.0)

Vinogradov O.P. (Lomonosov Moscow State University (MSU))
Shavgulidze E.T. (Lomonosov Moscow State University (MSU))

Abstract

Each finite binary chain of zeros and ones will be assigned a number, which will be called a measure of the randomness of this chain. The larger this measure, the more "random" the chain will be. A method for constructing chains with the largest measure is proposed.