CaltechAUTHORS
  A Caltech Library Service

A random construction for permutation codes and the covering radius

Keevash, Peter and Ku, Cheng Yeaw (2006) A random construction for permutation codes and the covering radius. Designs, Codes and Cryptography, 41 (1). pp. 79-86. ISSN 0925-1022. https://resolver.caltech.edu/CaltechAUTHORS:20200318-100513825

Full text is not posted in this repository. Consult Related URLs below.

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20200318-100513825

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.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1007/s10623-006-0017-3DOIArticle
https://rdcu.be/b26ujPublisherFree ReadCube access
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.
Subject Keywords:Permutation codes; Covering radius; Restricted intersections
Issue or Number:1
Classification Code:AMS Classification: 05D40
Record Number:CaltechAUTHORS:20200318-100513825
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20200318-100513825
Official Citation:Keevash, P., Ku, C.Y. A random construction for permutation codes and the covering radius. Des Codes Crypt 41, 79–86 (2006). https://doi.org/10.1007/s10623-006-0017-3
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:101966
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:18 Mar 2020 19:01
Last Modified:18 Mar 2020 19:01

Repository Staff Only: item control page