Published October 2006
| public
Journal Article
A random construction for permutation codes and the covering radius
- Creators
- Keevash, Peter
- Ku, Cheng Yeaw
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.
Additional Information
© 2006 Springer+Business Media, LLC. Received 27 January 2006; Revised 08 April 2006; Accepted 02 May 2006. We would like to thank the anonymous referees for their comments that helped us make several improvements to this paper.Additional details
- Eprint ID
- 101966
- Resolver ID
- CaltechAUTHORS:20200318-100513825
- Created
-
2020-03-18Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field