6 research outputs found
A Recursive Method for Enumeration of Costas Arrays
In this paper, we propose a recursive method for finding Costas arrays that
relies on a particular formation of Costas arrays from similar patterns of
smaller size. By using such an idea, the proposed algorithm is able to
dramatically reduce the computational burden (when compared to the exhaustive
search), and at the same time, still can find all possible Costas arrays of
given size. Similar to exhaustive search, the proposed method can be
conveniently implemented in parallel computing. The efficiency of the method is
discussed based on theoretical and numerical results
On the Measurement of the (Non)linearity of Costas Permutations
We study several criteria for the (non)linearity of Costas permutations, with or without the
imposition of additional algebraic structure in the domain and the range of the permutation, aiming
to find one that successfully identifies Costas permutations as more nonlinear than randomly chosen
permutations of the same order
Wide-Sense Fingerprinting Codes and Honeycomb Arrays
Standard logo The logo should be reproduced in the primary colou Pantone 660c, on all publications printed in two or more colours. Refer to the ‘Branded merchandize’ sheet for guidelines on use on promotional items et The text, ‘University of London’, is set as a 50% transparency of white. Do not use a keyline see ‘Non standard background for exceptions. The College name has been specially drawn; please use the original digital artwork and do not try to re-set