RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 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.

UDC: 621.391.1:003

Received: 26.02.2008
Revised: 10.04.2008


 English version: Problems of Information Transmission, 2008, 44:3, 226–232

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2026