RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 2012 Volume 48, Issue 1, Pages 37–53 (Mi ppi2067)
This article is cited 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.

UDC: 621.391.15

Received: 24.05.2011
Revised: 06.10.2011


 English version: Problems of Information Transmission, 2012, 48:1, 31–46

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025