|
Problemy Peredachi Informatsii, 2008, Volume 44, Issue 3, Pages 63–69
(Mi ppi1280)
|
|
|
|
Coding Theory
On Fragments of Words over a $q$-ary Alphabet
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 consider several combinatorial problems concerning fragments of words over a $q$-ary alphabet. We obtain a number of new facts, some of them being previously known in the binary case only.
Received: 26.02.2008 Revised: 10.04.2008
Citation:
V. K. Leont'ev, S. A. Mukhina, “On Fragments of Words over a $q$-ary Alphabet”, Probl. Peredachi Inf., 44:3 (2008), 63–69; Problems Inform. Transmission, 44:3 (2008), 226–232
Linking options:
https://www.mathnet.ru/eng/ppi1280 https://www.mathnet.ru/eng/ppi/v44/i3/p63
|
Statistics & downloads: |
Abstract page: | 320 | Full-text PDF : | 105 | References: | 60 | First page: | 6 |
|