Linda Morales

most citedEquivalence Relations for Computing Permutation Polynomials

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

collaborators

Showing cs.ITShow all

2 papers · 1 filter

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…