Abstract
Let \(A = \{a_k\}^\infty_{k = 1}\) be an infinite increasing sequence of positive integers. We define the infinite binary sequence \(\overline{A} = \{\alpha_j\}_{j=1}^\infty\) to have α j = 1 if j ∈ A, α j = 0 if j ∉ A (including when j ≤ 0). If \(B = \{b_k\}_{k=1}^\infty\) is also an infinite increasing sequence of positive integers with \(\overline{B} = \{\beta_j\}_{j = 1}^\infty\), by the “cross-correlation of A and B” we will mean the un-normalized, infinite-domain cross-correlation of \(\overline{A}\) and \(\overline{B}\), i.e.
for all τ ∈ Z.
Our interest will be in identifying pairs of sequences A and B for which C AB (τ) is finite for all τ ∈ Z, and especially when C AB (τ) < K for some uniform bound K, for all τ ∈ Z. We will exhibit pairs of sequences A and B where C AB (τ) ≤ 1 for all τ ∈ Z. If B = P = {p 1, p 2, p 3, ...} = {2, 3, 5, 7,...} is the sequence of the prime numbers, we will exhibit sequences A such that C AP (τ) is finite for all τ ∈ Z, and question whether a sequence A exists such that C AP (τ) < K for some uniform bound K and all τ ∈ Z.
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
Problem 10208. Amer. Math. Monthly (1992)
Golomb, S.W., Taylor, H.: Cyclic projective planes, perfect circular rulers, and good spanning rulers. In: Sequences and their Applications, Bergen, pp. 166–181 (2001); Discrete Math. Theor. Comput. Sci. (Lond.), Springer, London (2002)
Ribenboim, P.: The little book of bigger primes, 2nd edn. Springer, New York (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golomb, S.W. (2010). Infinite Sequences with Finite Cross-Correlation. In: Carlet, C., Pott, A. (eds) Sequences and Their Applications – SETA 2010. SETA 2010. Lecture Notes in Computer Science, vol 6338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15874-2_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-15874-2_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15873-5
Online ISBN: 978-3-642-15874-2
eBook Packages: Computer ScienceComputer Science (R0)