A random construction for permutation codes and the covering radius |
| |
Authors: | Peter Keevash Cheng Yeaw Ku |
| |
Institution: | (1) Department of Mathematics, Caltech, Pasadena, CA 91125, USA |
| |
Abstract: | We analyse a probabilistic argument that gives a semi-random construction for a permutation code on n symbols with distance n − s and size Θ(s!(log n)1/2), and a bound on the covering radius for sets of permutations in terms of a certain frequency parameter.
|
| |
Keywords: | Permutation codes Covering radius Restricted intersections |
本文献已被 SpringerLink 等数据库收录! |