|
Problemy Peredachi Informatsii, 2006, Volume 42, Issue 3, Pages 73–77
(Mi ppi54)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
On Fragments of Words
V. K. Leont'eva, S. A. Mukhinab a 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.
Received: 10.05.2006
Citation:
V. K. Leont'ev, S. A. Mukhina, “On Fragments of Words”, Probl. Peredachi Inf., 42:3 (2006), 73–77; Problems Inform. Transmission, 42:3 (2006), 230–233
Linking options:
https://www.mathnet.ru/eng/ppi54 https://www.mathnet.ru/eng/ppi/v42/i3/p73
|
Statistics & downloads: |
Abstract page: | 492 | Full-text PDF : | 115 | References: | 67 | First page: | 8 |
|