English

Costas cubes

Combinatorics 2017-08-04 v2 Information Theory math.IT

Abstract

A Costas array is a permutation array for which the vectors joining pairs of 11s are all distinct. We propose a new three-dimensional combinatorial object related to Costas arrays: an order nn Costas cube is an array (di,j,k)(d_{i,j,k}) of size n×n×nn \times n \times n over Z2\mathbb{Z}_2 for which each of the three projections of the array onto two dimensions, namely (idi,j,k)(\sum_i d_{i,j,k}) and (jdi,j,k)(\sum_j d_{i,j,k}) and (kdi,j,k)(\sum_k d_{i,j,k}), is an order nn Costas array. We determine all Costas cubes of order at most 2929, showing that Costas cubes exist for all these orders except 1818 and 1919 and that a significant proportion of the Costas arrays of certain orders occur as projections of Costas cubes. We then present constructions for four infinite families of Costas cubes.

Cite

@article{arxiv.1702.05473,
  title  = {Costas cubes},
  author = {Jonathan Jedwab and Lily Yen},
  journal= {arXiv preprint arXiv:1702.05473},
  year   = {2017}
}

Comments

12 pages, 1 figure. Theorem 11 introduces two further infinite families of Costas cubes