\begin{thebibliography}{10}

\bibitem{challis1993}
M.~F. Challis, Two new techniques for computing extremal $h$-bases ${A}_k$,
  {\em Comput. J.} {\bf 36} (1993), 117--126.

\bibitem{eliahou1998}
S.~Eliahou and M.~Kervaire, Sumsets in vector spaces over finite fields, {\em
  J. Number Theory} {\bf 71} (1998), 12--39.

\bibitem{eliahou2005}
S.~Eliahou and M.~Kervaire, Minimal sumsets in infinite abelian groups, {\em J.
  Algebra} {\bf 287} (2005), 449--457.

\bibitem{eliahou2003}
S.~Eliahou, M.~Kervaire, and A.~Plagne, Optimally small sumsets in finite
  abelian groups, {\em J. Number Theory} {\bf 101} (2003), 338--3487.

\bibitem{hammerer1976}
N.~H{\"a}mmerer and G.~Hofmeister, Zu einer {V}ermutung von {R}ohrbach, {\em J.
  Reine Angew. Math.} {\bf 286/287} (1976), 239--247.

\bibitem{han2004}
S.~P.~S. Han, The boundary structure of the sumset in {$\mathbf{Z}^2$}.
\newblock In D.~Chudnovsky, G.~Chudnovsky, and M.~Nathanson, editors, {\em
  Number Theory}, pp.  201--218. Springer, 2004.

\bibitem{haubrich1968array}
R.~A. Haubrich, Array design, {\em Bulletin of the Seismological Society of
  America} {\bf 58} (1968), 977--991.

\bibitem{hoctor1990}
R.~T. Hoctor and S.~A. Kassam, The unifying role of the coarray in aperture
  synthesis for coherent and incoherent imaging, {\em Proceedings of the IEEE}
  {\bf 78} (1990), 735--752.

\bibitem{kohonen2015early}
J.~Kohonen, Early pruning in the restricted postage stamp problem.
\newblock Preprint, 2015, \url{https://arxiv.org/abs/1503.03416}.

\bibitem{kohonen2014meet}
J.~Kohonen, A meet-in-the-middle algorithm for finding extremal restricted
  additive 2-bases, {\em J. Integer Seq.} {\bf 17} (2014), 3.

\bibitem{kohonen2017}
J.~Kohonen, An improved lower bound for finite additive 2-bases, {\em J. Number
  Theory} {\bf 174} (2017), 518--524.

\bibitem{kohonen2014}
J.~Kohonen and J.~Corander, Addition chains meet postage stamps: Reducing the
  number of multiplications, {\em J. Integer Seq.} {\bf 17} (2014), Article
  14.3.4.

\bibitem{kozick1991}
R.~J. Kozick and S.~A. Kassam, Linear imaging with sensor arrays on convex
  polygonal boundaries, {\em IEEE Trans. Systems Man Cybernet.} {\bf 21}
  (1991), 1155--1166.

\bibitem{leech1956}
J.~Leech, On the representation of 1, 2, \ldots, $n$ by differences, {\em J.
  Lond. Math. Soc.} {\bf s1-31} (1956), 160--169.

\bibitem{linebarger1993difference}
D.~A. Linebarger, I.~H. Sudborough, and I.~G. Tollis, Difference bases and
  sparse sensor arrays, {\em IEEE Trans. Inform. Theory} {\bf 39} (1993),
  716--721.

\bibitem{liu2017}
C.~L. Liu and P.~P. Vaidyanathan, Hourglass arrays and other novel 2-{D} sparse
  arrays with reduced mutual coupling, {\em IEEE Trans. Signal Process.} {\bf
  65} (2017), 3369--3383.

\bibitem{lunnon1969}
W.~F. Lunnon, A postage stamp problem, {\em Comput. J.} {\bf 12} (1969),
  377--380.

\bibitem{mrose1979}
A.~Mrose, Untere {S}chranken f{\"u}r die {R}eichweiten von {E}xtremalbasen
  fester {O}rdnung, {\em Abh. Math. Semin. Univ. Hambg.} {\bf 48} (1979),
  118--124.

\bibitem{naidu2009}
P.~S. Naidu, {\em Sensor Array Signal Processing}, CRC Press, 2nd edition,
  2009.

\bibitem{pal2010nested}
P.~Pal and P.~P. Vaidyanathan, Nested arrays: A novel approach to array
  processing with enhanced degrees of freedom, {\em IEEE Trans. Signal
  Process.} {\bf 58} (2010), 4167--4181.

\bibitem{riddell1978}
J.~Riddell and C.~Chan, Some extremal 2-bases, {\em Math. Comp.} {\bf 32}
  (1978), 630--634.

\bibitem{rohrbach1937}
H.~Rohrbach, Ein {B}eitrag zur additiven {Z}ahlentheorie, {\em Math. Z.} {\bf
  42} (1937), 1--30.

\bibitem{wichmann1963anote}
B.~Wichmann, A note on restricted difference bases, {\em J. Lond. Math. Soc.}
  {\bf s1-38} (1963), 465--466.

\bibitem{yu2009}
G.~Yu, Upper bounds for finite additive 2-bases, {\em Proc. Amer. Math. Soc.}
  {\bf 137} (2009), 11--18.

\bibitem{yu2015}
G.~Yu, A new upper bound for finite additive $h$-bases, {\em J. Number Theory}
  {\bf 156} (2015), 95--104.

\end{thebibliography}
