Linda Morales

most citedEquivalence Relations for Computing Permutation Polynomials

1 citations · 1 across the 1 of their papers we have counts for

collaborators

4 papers

math.CO2020

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions

Sergey Bereg, Brian Malouf, Linda Morales +2

We consider rational functions of the form $V (x) / U (x)$ , where both $V (x)$ and $U (x)$ are polynomials over the finite field $F_{q}$ . Polynomials that permute the elements of…

cs.IT2020★ 1 cited

Equivalence Relations for Computing Permutation Polynomials

Sergey Bereg, Brian Malouf, Linda Morales +3

We present a new technique for computing permutation polynomials based on equivalence relations. The equivalence relations are defined by expanded normalization operations and new…

cs.IT2018

Constructing Permutation Arrays using Partition and Extension

Sergey Bereg, Luis Gerardo Mojica, Linda Morales +1

We give new lower bounds for $M (n, d)$ , for various positive integers $n$ and $d$ with $n > d$ , where $M (n, d)$ is the largest number of permutations on $n$ symbols with pairwise Hammi…

math.CO2018

New Lower Bounds for Permutation Arrays Using Contraction

Sergey Bereg, Zevi Miller, Luis Gerardo Mojica +2

A permutation array $A$ is a set of permutations on a finite set $Ω$ , say of size $n$ . Given distinct permutations $π, σ \in Ω$ , we let $h d (π, σ) = ∣ {x \in Ω : π (x) \neq = σ (x)} ∣$ , c…