OFFSET
1,3
COMMENTS
Constructed on p. 21 of Jaromczyk. Let k be a positive integer. A sequence s over an n-element alphabet A is called a k-radius sequence if every two symbols from A occur in s at distance of at most k. Generalizes Ghosh, 1975.
LINKS
S. P. Ghosh, Consecutive storage of relevant records with redundancy, Comm. ACM 18 (8) (1975) 464-471.
Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski, Constructions of asymptotically shortest k-radius sequences, arXiv:1105.0654 [math.CO], 2011.
J. Jaromczyk, and Z. Lonc, Sequences of radius k: how to fetch many huge objects into small memory for pairwise computations, 15th International Symposium, ISAAC 2004, Hong Kong, Lecture Notes in Computer Science 3341 (2004) 594-605.
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
Jonathan Vos Post, May 04 2011
STATUS
approved