By Topic

The enumeration of Costas arrays of order 28

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Drakakis, K. ; UCD CASL & Sch. of Electr., Univ. Coll. Dublin, Dublin, Ireland ; Iorio, F. ; Rickard, Scott

We present the results of the enumeration of Costas arrays of order 28: all arrays found are accounted for by the Golomb and Welch construction methods, making 28 the first order (larger than 5) for which no sporadic Costas arrays exist. The enumeration was performed on several computer clusters and required the equivalent of 70 years of single CPU time.

Published in:

Information Theory Workshop (ITW), 2010 IEEE

Date of Conference:

Aug. 30 2010-Sept. 3 2010