Abstract
A synchronization pattern is a sequence of dots in which the out-of-phase autocorrelation function takes the values zero or one. These patterns have numerous applications in information theory. Recently, two-dimensional synchronization patterns have found application in key predistribution for wireless sensor networks. This application has raised some new questions. We will discuss some of the old and new questions in this area. We will describe several solution techniques and present some open problems.
This research was supported in part by the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel, under Grant 2006097.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Blackburn, S.R., Etzion, T., Martin, K.M., Paterson, M.B.: Efficient key predistribution for grid-based wireless sensor networks. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol. 5155, pp. 54–69. Springer, Heidelberg (2008)
Blackburn, S.R., Etzion, T., Martin, K.M., Paterson, M.B.: Two-Dimensional Patterns with Distinct Differences – Constructions, Bounds, and Maximal Anticodes (preprint)
Blackburn, S.R., Etzion, T., Martin, K.M., Paterson, M.B.: Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks (preprint)
Drakakis, K., Rickard, S., Beard, J.K., Caballero, R., Iorio, F., O’Brien, G., Walsh, J.: Results on Costas arrays of order 27. IEEE Trans. Inform. Theory IT-44, 730–743 (1998)
Erdős, P., Graham, R., Ruzsa, I.Z., Taylor, H.: Bounds for arrays of dots with distinct slopes or lengths. Combinatorica 12, 39–44 (1992)
Erdős, P., Turán, P.: On a problem of Sidon in additive number theory and some related problems. J. London Math. Soc. 16, 212–215 (1941)
Etzion, T.: Folding, tiling, and multidimensional coding (preprint)
Golomb, S.W.: Algebraic constructions for Costas arrays. J. Combin. Theory, Series A 37, 13–21 (1984)
Golomb, S.W., Taylor, H.: Two-dimensional synchronization patterns for minimum ambiguity. IEEE Trans. Inform. Theory IT-28, 600–604 (1982)
Golomb, S.W., Taylor, H.: Constructions and properties of Costas arrays. Proceedings of the IEEE 72, 1143–1163 (1984)
Hamkins, J., Zeger, K.: Improved bounds on maximum size binary radar arrays. IEEE Trans. Inform. Theory IT-43, 997–1000 (1997)
Lefmann, H., Thiele, T.: Point sets with distinct distances. Combinatorica 15, 379–408 (1995)
O’Bryant, K.: A complete annotated bibliography of work related to Sidon sequences. The Electronic Journal of Combinatorics DS11, 1–39 (2004)
Peile, R.E., Taylor, H.: Sets of points with pairwise distinct slopes. Computers and Mathematics 39, 109–115 (2000)
Robinson, J.P.: Golomb rectangles. IEEE Trans. Inform. Theory IT-31, 781–787 (1985)
Robinson, J.P.: Golomb rectangles as folded ruler. IEEE Trans. Inform. Theory IT-43, 290–293 (1997)
Robinson, J.P.: Genetic search for Golomb arrays. IEEE Trans. Inform. Theory IT-46, 1170–1173 (2000)
Robinson, J.P., Bernstein, A.J.: A class of binary recurrent codes with limited error propagation. IEEE Trans. Inform. Theory IT-13, 106–113 (1967)
Ruzsa, I.Z.: Solving a linear equation in a set of integers. Acta Arith. 65, 259–282 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Etzion, T. (2009). Problems on Two-Dimensional Synchronization Patterns. In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds) Coding and Cryptology. IWCC 2009. Lecture Notes in Computer Science, vol 5557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01877-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-01877-0_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01813-8
Online ISBN: 978-3-642-01877-0
eBook Packages: Computer ScienceComputer Science (R0)