Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes

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.

[1]  N. Levanon,et al.  Any two N × N costas signals must have at least one common ambiguity sidelobe if N > 3—A proof , 1985, Proceedings of the IEEE.

[2]  J. Maynard On the difference between consecutive primes , 2012, 1201.1787.

[3]  R. Ahlswede,et al.  The diametric theorem in Hamming spaces-optimal anticodes , 1997, Proceedings of IEEE International Symposium on Information Theory.

[4]  Rudolf Ahlswede,et al.  On Perfect Codes and Related Concepts , 2001, Des. Codes Cryptogr..

[5]  Solomon W. Golomb The T4 and G4 constructions for Costas arrays , 1992, IEEE Trans. Inf. Theory.

[6]  Hanno Lefmann,et al.  Point sets with distinct distances , 1995, Comb..

[7]  Zhen Zhang,et al.  New bounds for the sizes of radar arrays , 1994, IEEE Trans. Inf. Theory.

[8]  Alexander Vardy,et al.  Optimal tristance anticodes in certain graphs , 2006, J. Comb. Theory, Ser. A.

[9]  N. F. Gjeddebæk On the difference between consecutive primes , 1966 .

[10]  Tuvi Etzion,et al.  Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks , 2008, IEEE Transactions on Information Theory.

[11]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[12]  P. Ebdos,et al.  ON A PROBLEM OF SIDON IN ADDITIVE NUMBER THEORY, AND ON SOME RELATED PROBLEMS , 2002 .

[13]  S. Golomb,et al.  Perfect Codes in the Lee Metric and the Packing of Polyominoes , 1970 .

[14]  P. Erdös,et al.  On a problem of sidon in additive number theory, and on some related problems , 1941 .

[15]  Solomon W. Golomb,et al.  Two-dimensional synchronization patterns for minimum ambiguity , 1982, IEEE Trans. Inf. Theory.

[16]  Paul Erdös,et al.  Bounds for arrays of dots with distinct slopes or lengths , 1992, Comb..

[17]  T. Etzion,et al.  Combinatorial designs derived from Costas arrays , 1990 .

[18]  Moshe Schwartz,et al.  Codes and Anticodes in the Grassman Graph , 2002, J. Comb. Theory, Ser. A.

[19]  P. Delsarte AN ALGEBRAIC APPROACH TO THE ASSOCIATION SCHEMES OF CODING THEORY , 2011 .

[20]  John P. Robinson Golomb rectangles as folded rulers , 1997, IEEE Trans. Inf. Theory.

[21]  Dilip V. Sarwate,et al.  On optimum time-hopping patterns , 1988, IEEE Trans. Commun..

[22]  Jorge Urrutia,et al.  Integer Sets with Distinct Sums and Differences and Carrier Frequency Assignments for Nonlinear Repeaters , 1986, IEEE Trans. Commun..

[23]  Rudolf Ahlswede,et al.  The Complete Nontrivial-Intersection Theorem for Systems of Finite Sets , 1996, J. Comb. Theory, Ser. A.

[24]  Jon Hamkins,et al.  Improved bounds on maximum size binary radar arrays , 1997, IEEE Trans. Inf. Theory.

[25]  R. E Peile,et al.  Sets of points with pairwise distinct slopes , 2000 .

[26]  Roger C. Alperin,et al.  Golomb Rulers , 2011 .

[27]  Béla Bollobás,et al.  Littlewood's Miscellany , 1986 .

[28]  Tuvi Etzion,et al.  Efficient Key Predistribution for Grid-Based Wireless Sensor Networks , 2008, ICITS.

[29]  William J. Martin,et al.  Anticodes for the Grassman and bilinear forms graphs , 1995, Des. Codes Cryptogr..

[30]  Alexander Vardy,et al.  Interleaving Schemes for Multidimensional Cluster Errors , 1998, IEEE Trans. Inf. Theory.

[31]  Zhen Zhang A note on arrays of dots with distinct slopes , 1993, Comb..

[32]  Aart Blokhuis,et al.  Bounds for the size of radar arrays , 1988, IEEE Trans. Inf. Theory.

[33]  John P. Robinson Golomb rectangles , 1985, IEEE Trans. Inf. Theory.

[34]  W. C. Babcock Intermodulation interference in radio systems frequency of occurrence and control by channel selection , 1953 .

[35]  S. Golomb,et al.  Constructions and properties of Costas arrays , 1984, Proceedings of the IEEE.

[36]  S. Bhogle,et al.  LITTLEWOOD'S MISCELLANY , 1990 .

[37]  K. O'Bryant A Complete Annotated Bibliography of Work Related to Sidon Sequences , 2004, math/0407117.

[38]  Robert M. Gagliardi,et al.  Acquisition sequences in PPM communications , 1987, IEEE Trans. Inf. Theory.

[39]  Oscar Moreno,et al.  Sonar sequences from Costas arrays and the best known sonar sequences with up to 100 symbols , 1993, IEEE Trans. Inf. Theory.

[40]  Tuvi Etzion Tilings with Generalized Lee Spheres , 2003 .

[41]  Solomon W. Golomb,et al.  Algebraic Constructions for Costas Arrays , 1984, J. Comb. Theory, Ser. A.

[42]  Arthur J. Bernstein,et al.  A class of binary recurrent codes with limited error propagation , 1967, IEEE Trans. Inf. Theory.

[43]  R. A. Games An algebraic construction of sonar sequences using M -sequences , 1987 .

[44]  John P. Robinson Genetic search for Golomb arrays , 2000, IEEE Trans. Inf. Theory.