1 citations · 1 across the 4 of their papers we have counts for
4 papers
Improved Bounds for Permutation Arrays Under Chebyshev Distance
Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf +1
Permutation arrays under the Chebyshev metric have been considered for error correction in noisy channels. Let denote the maximum size of any array of permutations on …
Bounds for Permutation Arrays under Kendall Tau Metric
Sergey Bereg, William Bumpass, Mohammadreza Haghpanah +2
Permutation arrays under the Kendall- metric have been considered for error-correcting codes. Given and , the task is to find a large permutation arr…
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions
Sergey Bereg, Brian Malouf, Linda Morales +2
We consider rational functions of the form , where both and are polynomials over the finite field . Polynomials that permute the elements of…
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…