New Constructions of Extended Sonar Sequences From Sidon Sets

A
$(m,n)$
sonar sequence is an
$m\times n$
array with exactly one dot in each column and where all lines connecting two dots in the array are distinct as vectors. These arrays are known to have many applications such as sonar and radar detection and these are studied as a particular case of Golomb rectangles or two-dimensional Sidon sets. The main open problem for sonar sequences is: for fixed
$m$
, find the largest
$n$
for which there is an
$(m,n)$
sonar sequence, these sequences are called the best sonar sequences. The extended sonar sequences are generalizations of sonar sequences where each column has at most one dot, the motivation to study these arrays are the best results obtained when applied to radar and sonar detection. In this paper, we give the best sonar sequences with
$m\leq 100$
obtained from an exhaustive computational search based on the Caicedo, Ruiz and Trujillo constructions and we present new constructions of extended sonar sequences that use Sidon sets.