Packing Costas arrays
From MaRDI portal
Publication:2895355
Abstract: A Costas latin square of order n is a set of n disjoint Costas arrays of the same order. Costas latin squares are studied here from a construction as well as a classification point of view. A complete classification is carried out up to order 27. In this range, we verify the conjecture that there is no Costas latin square for any odd order n >= 3. Various other related combinatorial structures are also considered, including near Costas latin squares (which are certain packings of near Costas arrays) and Vatican Costas squares.
Recommendations
Cited in
(10)- scientific article; zbMATH DE number 1501083 (Why is no real title available?)
- Parity properties of Costas arrays defined via finite fields
- Investigating the existence of Costas Latin squares via satisfiability testing
- scientific article; zbMATH DE number 434861 (Why is no real title available?)
- scientific article; zbMATH DE number 1943096 (Why is no real title available?)
- On maximal partial costas Latin squares
- Interlaced Costas arrays do not exist
- Open problems in Costas arrays
- Enumeration of parallelograms in permutation matrices for improved bounds on the density of Costas arrays
- scientific article; zbMATH DE number 4145919 (Why is no real title available?)
This page was built for publication: Packing Costas arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2895355)