Abstract
Recently we introduced and studied the shadow minimization problem under word-subword relation. In this paper we consider this problem for the restricted case and give optimal solution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ahlswede, R., Cai, N.: Shadows and isoperimetry under the sequence-subsequence relation. Combinatorica 17(1), 11–29 (1997)
Ahlswede, R., Lebedev, V.: Shadows under the word-subword relation. In: Twelfth International Workshop on Algebraic and Combinatorial Coding Theory, Akademgorodok, Novosibirsk, pp. 16–19 (2010)
Ahlswede, R., Lebedev, V.: Shadows under the word-subword relation. Problems of Information Transmission 48(1), 30–45 (2012)
Chowdhury, A., Patkos, B.: Shadows and intersections in vector spaces. J. Combin. Theory Ser. A 117(8), 1095–1106 (2010)
Kruskal, J.B.: The Number of Simplices in a Complex, Mathematical Optimization Techniques, Berkeley, Los Angeles, pp. 251–278 (1963)
Katona, G.: A theorem on finite sets. In: Theory of Graphs, Proc. Colloq. Tihany 1966, pp. 187–207. Akadémiai Kiadó (1968)
Lindström, B.A., Zetterström, H.O.: A combinatorial problem in the k-adic number systems. Proc. Amer. Math. Soc. 18, 166–170 (1967)
Schützenberger, M.P.: A characteristic property of certain polynomials of E.F. Moore and C.E. Shannon, RLE Quarterly Progress Report, No. 55, Research Laboratory of Electronics, M.I.T., pp. 117–118 (1959)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Lebedev, V. (2013). The Restricted Word Shadow Problem. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-36899-8_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-36898-1
Online ISBN: 978-3-642-36899-8
eBook Packages: Computer ScienceComputer Science (R0)