On a reconstruction problem for sequences

[摘要] It is shown that any word of length n is uniquely determined by all its ((n)(k)) subwords of length k, provided k greater than or equal to[16/7 root n]+5. This improves the bound k greater than or equal to[n/2] given in B. Manvel et al. (Discrete Math. 94 (1991), 209-219). (C) 1997 Academic Press.

[发布日期] 1997-02-01