2018/04/23 by Bereg, Sergey, Mojica, Luis Gerardo, Morales, Linda +1
#FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.1804.08252
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 Hamming distance at least d. Large sets of permutations on n symbols with pairwise Hamming distance d is a necessary component of constructing error correcting permutation codes, which have been proposed for power-line communications. Our technique, \em partition and extension, is universally applicable to constructing such sets for all n and all d, d