|
Problemy Peredachi Informatsii, 2012, Volume 48, Issue 1, Pages 37–53
(Mi ppi2067)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
Shadows under the word-subword relation
R. Ahlswede, V. S. Lebedeva a Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow
Abstract:
We introduce a minimal shadow problem for a word-subword relation. We obtain upper and lower bounds for the minimal shadow cardinality.
Received: 24.05.2011 Revised: 06.10.2011
Citation:
R. Ahlswede, V. S. Lebedev, “Shadows under the word-subword relation”, Probl. Peredachi Inf., 48:1 (2012), 37–53; Problems Inform. Transmission, 48:1 (2012), 31–46
Linking options:
https://www.mathnet.ru/eng/ppi2067 https://www.mathnet.ru/eng/ppi/v48/i1/p37
|
Statistics & downloads: |
Abstract page: | 239 | Full-text PDF : | 78 | References: | 42 | First page: | 17 |
|