This article is cited in 1 paper

Coding Theory

On Fragments of Words

V. K. Leont'ev^a, S. A. Mukhina<sup>b

a</sup> Dorodnitsyn Computing Centre of the Russian Academy of Sciences
^b M. V. Lomonosov Moscow State University

Abstract: We find a precise value of the function $F_N(m,n,k)$, which is the number of binary words of length $N$ and weight $m$ that contain an arbitrary word of length $n$ and weight $k$ as a fragment. As a consequence, we obtain a known result on the number of binary words of length $N$ that contain a fixed word of length $n$ as a fragment.

UDC: 621.391.1:003

Received: 10.05.2006

 English version: Problems of Information Transmission, 2006, 42:3, 230–233

Bibliographic databases:

• 
•