Shadows under the word-subword relation

Authors:
R. Ahlswede;V. S. Lebedev
Affiliations:
-;Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2012

Citing 3
Cited 2

Isoperimetric numbers of graphs

Journal of Combinatorial Theory Series B
The spectrum of de Bruijn and Kautz graphs

European Journal of Combinatorics
Shadows and intersections in vector spaces

Journal of Combinatorial Theory Series A

The restricted word shadow problem

Information Theory, Combinatorics, and Search Theory
Bibliography of publications by Rudolf Ahlswede

Information Theory, Combinatorics, and Search Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce a minimal shadow problem for a word-subword relation. We obtain upper and lower bounds for the minimal shadow cardinality.