Search Results - "Rubio, Ivelisse"
-
1
Circular Costas maps: A multidimensional analog of circular Costas sequences
Published in Cryptography and communications (01-09-2023)“…A unifying theoretical framework is presented, in which the connections among Costas sequences, circular Costas sequences, Costas polynomials, the shifting…”
Get full text
Journal Article -
2
Analysis and computation of multidimensional linear complexity of periodic arrays
Published in Designs, codes, and cryptography (01-03-2024)“…Linear complexity is an important parameter for arrays that are used in applications related to information security. In this work we survey constructions of…”
Get full text
Journal Article -
3
New families of balanced symmetric functions and a generalization of Cusick, Li and Stǎnicǎ’s conjecture
Published in Designs, codes, and cryptography (01-03-2018)“…In this paper we provide new families of balanced symmetric functions over any finite field. We also generalize a conjecture of Cusick, Li, and Stǎnicǎ about…”
Get full text
Journal Article -
4
Exact 2-divisibility of exponential sums associated to boolean functions
Published in Cryptography and communications (01-07-2018)“…In this paper we extend the covering method for computing the exact 2-divisibility of exponential sums of Boolean functions, improve results on the…”
Get full text
Journal Article -
5
Exact p-divisibility of exponential sums via the covering method
Published in Proceedings of the American Mathematical Society (01-03-2015)“…-divisibility of exponential sums of new families of polynomials, to unify and improve previously known results, and to construct families of systems of…”
Get full text
Journal Article -
6
Multidimensional Costas Arrays and Their Periodicity
Published in IEEE transactions on information theory (01-08-2023)“…A novel higher-dimensional definition for Costas arrays is introduced. This definition works for arbitrary dimensions and avoids some limitations of previous…”
Get full text
Journal Article -
7
Permutation binomials of the form x(x−1 + a) over F q e
Published in Finite fields and their applications (01-03-2022)Get full text
Journal Article -
8
Permutation binomials of the form xr(xq−1 + a) over Fqe
Published in Finite fields and their applications (01-03-2022)“…We present several existence and nonexistence results for permutation binomials of the form xr(xq−1+a), where e≥2 and a∈Fqe⁎. As a consequence, we obtain a…”
Get full text
Journal Article -
9
Multidimensional linear complexity analysis of periodic arrays
Published in Applicable algebra in engineering, communication and computing (2020)“…The linear complexity of a sequence is an important parameter for many applications, especially those related to information security, and hardware…”
Get full text
Journal Article -
10
Circular Costas maps: a multidimensional analog of circular Costas sequences
Published 29-10-2022“…A unifying theoretical framework is presented, in which the connections among Costas sequences, circular Costas sequences, Costas polynomials, the shifting…”
Get full text
Journal Article -
11
Multidimensional Costas Arrays and Their Periodicity
Published 03-08-2022“…A novel higher-dimensional definition for Costas arrays is introduced. This definition works for arbitrary dimensions and avoids some limitations of previous…”
Get full text
Journal Article -
12
Analysis and Computation of Multidimensional Linear Complexity of Periodic Arrays
Published 28-07-2022“…Linear complexity is an important parameter for arrays that are used in applications related to information security. In this work we survey constructions of…”
Get full text
Journal Article -
13
Permutation binomials of the form $x^r(x^{q-1}+a)$ over $\mathbb F_{q^e}
Published 22-09-2020“…Finite Fields Appl. 79 (2022), 102003 We present several existence and nonexistence results for permutation binomials of the form $x^r(x^{q-1}+a)$, where…”
Get full text
Journal Article -
14
Divisibility of exponential sums via elementary methods
Published in Journal of number theory (01-07-2010)“…We present an elementary method for evaluating the order of p-divisibility of exponential sums over a prime field. This method unifies and sometimes improves…”
Get full text
Journal Article -
15
On systems of linear and diagonal equation of degree p i + 1 over finite fields of characteristic p
Published in Finite fields and their applications (01-07-2008)“…One of the most important questions in number theory is to find properties on a system of equations that guarantee solutions over a field. A well-known problem…”
Get full text
Journal Article -
16
DIVISIBILITY OF EXPONENTIAL SUMS AND SOLVABILITY OF CERTAIN EQUATIONS OVER FINITE FIELDS
Published in Quarterly journal of mathematics (01-06-2009)“…Carlitz [Solvability of certain equations in a finite field, Quart. J. Math. (Oxford) 7 (1956), 3–4] determined conditions under which infinite families of…”
Get full text
Journal Article -
17
Linear complexity for multidimensional arrays - a numerical invariant
Published in 2015 IEEE International Symposium on Information Theory (ISIT) (01-06-2015)“…Linear complexity is a measure of how complex a one dimensional sequence can be. In this paper we extend the concept of linear complexity to multiple…”
Get full text
Conference Proceeding Journal Article -
18
Grobner bases for 0-dimensional ideals and applications to decoding
Published 01-01-1998“…Grobner bases are generating sets for ideals which can be used to give algorithmic solutions to many problems that arise in commutative algebra and other areas…”
Get full text
Dissertation -
19
An Elementary Approach to Ax-Katz, McEliece's Divisibility and Applications to Quasi-Perfect Binary 2-Error Correcting Codes
Published in 2006 IEEE International Symposium on Information Theory (01-07-2006)“…In this paper we present an algorithmic approach to the problem of the divisibility of the number of solutions to a system of polynomial equations. Using this…”
Get full text
Conference Proceeding -
20
Algebraic construction of interleavers using permutation monomials
Published in 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577) (2004)“…We present an algebraic construction for interleavers of length p/sup r/, where p is any prime. These interleavers are very simple to implement and have…”
Get full text
Conference Proceeding