53 citations · 112 across the 26 of their papers we have counts for
Showing cs.ITShow all
3 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
A construction of product blocks with a fixed block size
Sergey Bereg
Let be the maximum size of a permutation array on symbols with pairwise Hamming distance at least . Some permutation arrays can be constructed using blocks of certa…
cs.IT2018
Constructing Permutation Arrays using Partition and Extension
Sergey Bereg, Luis Gerardo Mojica, Linda Morales +1
We give new lower bounds for , for various positive integers and with , where is the largest number of permutations on symbols with pairwise Hammi…