New bounds for the sizes of radar arrays

Improved upper bounds for the size of radar arrays are found by using the window method. New general constructions and computer-searched examples are presented. The radar array problem is generalized to include arrays with sidelobes greater than 1. >

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

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

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