Problems on Two-Dimensional Synchronization Patterns

Authors:
Tuvi Etzion
Affiliations:
Department of Computer Science, Technion, Haifa, Israel 32000
Venue:
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
Year:
2009

Citing 5
Cited 0

Golomb rectangles

IEEE Transactions on Information Theory
Efficient Key Predistribution for Grid-Based Wireless Sensor Networks

ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Golomb rectangles as folded rulers

IEEE Transactions on Information Theory
Improved bounds on maximum size binary radar arrays

IEEE Transactions on Information Theory
Genetic search for Golomb arrays

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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.