z-logo
open-access-imgOpen Access
On the degrees of freedom of Costas permutations and other constraints
Author(s) -
Konstantinos Drakakis
Publication year - 2011
Publication title -
advances in mathematics of communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.601
H-Index - 26
eISSN - 1930-5346
pISSN - 1930-5338
DOI - 10.3934/amc.2011.5.435
Subject(s) - golomb coding , mathematics , iterated function , combinatorics , sequence (biology) , degrees of freedom (physics and chemistry) , field (mathematics) , discrete mathematics , pure mathematics , mathematical analysis , computer science , image compression , physics , quantum mechanics , artificial intelligence , biology , image (mathematics) , genetics , image processing
The number of degrees of freedom of Costas permutations is considered, and found to be surprisingly small, while partial results about the degrees of freedom of Golomb and Welch Costas permutations are proved. For Golomb Costas permutations, in particular, the curious observation is made that arbitrarily long sequences of distinct positive integers seem to exist, with the property that two or more Golomb Costas permutations, constructed in a suitably large field, start with such a sequence; other types of constraints, related to their cycle structure, are studied; and finally it is shown that, in any extension field containing non-quadratic subfields, Lempel Costas permutations are obtainable through the iterated composition of other Golomb Costas permutations.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom