Skip to main content
Article thumbnail
Location of Repository

Two-dimensional patterns with distinct differences; constructions, bounds, and maximal anticodes

By S.R. Blackburn, T. Etzion, K.M. Martin and Maura B. Paterson


A two-dimensional (2-D) grid with dots is called a configuration with distinct differences if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many applications such as radar, sonar, physical alignment, and time-position synchronization. Rather than restricting dots to lie in a square or rectangle, as previously studied, we restrict the maximum distance between dots of the configuration; the motivation for this is a new application of such configurations to key distribution in wireless sensor networks. We consider configurations in the hexagonal grid as well as in the traditional square grid, with distances measured both in the Euclidean metric, and in the Manhattan or hexagonal metrics. We note that these configurations are confined inside maximal anticodes in the corresponding grid. We classify maximal anticodes for each diameter in each grid. We present upper bounds on the number of dots in a pattern with distinct differences contained in these maximal anticodes. Our bounds settle (in the negative) a question of Golomb and Taylor on the existence of honeycomb arrays of arbitrarily large size. We present constructions and lower bounds on the number of dots in configurations with distinct differences contained in various 2-D shapes (such as anticodes) by considering periodic configurations with distinct differences in the square grid

Topics: ems
Publisher: IEEE
Year: 2010
OAI identifier:

Suggested articles


  1. (1993). A note on arrays of dots with distinct slopes”, doi
  2. (1987). Acquisition sequences in PPM communications”, doi
  3. (1987). An algebraic construction of sonar sequences using Msequences,” doi
  4. (1967). Bernstein “A class of binary recurrent codes with limited error propagation”, doi
  5. (1992). Bounds for arrays of dots with distinct slopes or lengths”, doi
  6. (1988). Bounds for the size of radar arrays”, doi
  7. Efficient key predistribution for grid-based wireless sensor networks,” doi
  8. (1972). How to number a graph,” doi
  9. (1997). Improved bounds on maximum size binary radar arrays”, doi
  10. (1986). Integer sets with distinct sums and differences and carrier frequency assignments for nonlinear repeaters”, doi
  11. (1953). Intermodulation interference in radio systems,” doi
  12. (1975). Medium constraints on sonar design and performance,”
  13. (1994). New bounds for the sizes of radar arrays”, doi
  14. (1988). On optimum time-hopping patterns”, doi
  15. (1995). Point sets with distinct distances”, doi
  16. (2000). Robinson “Genetic search for Golomb arrays”, doi
  17. (1997). Robinson “Golomb rectangles as folded ruler”, doi
  18. (1985). Robinson “Golomb rectangles”, doi
  19. (2000). Sets of points with pairwise distinct slopes”, doi
  20. (1993). Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbols”, doi
  21. Two-dimensional synchronization patterns for minimum ambiguity”, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.