53 citations · 112 across the 26 of their papers we have counts for
9 papers · 1 filter
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…
New Lower Bounds for Tverberg Partitions with Tolerance in the Plane
Sergey Bereg, Mohammadreza Haghpanah
Let be a set points in a -dimensional space. Tverberg's theorem says that, if is at least , then can be partitioned into sets whose convex hull…
A lower bound on permutation codes of distance
Sergey Bereg, Peter Dukes
A classical recursive construction for mutually orthogonal latin squares (MOLS) is shown to hold more generally for a class of permutation codes of length and minimum distance…
New Lower Bounds for Permutation Arrays Using Contraction
Sergey Bereg, Zevi Miller, Luis Gerardo Mojica +2
A permutation array is a set of permutations on a finite set , say of size . Given distinct permutations , we let , c…