A random construction for permutation codes and the covering radius

Authors:
Peter Keevash;Cheng Yeaw Ku
Affiliations:
Department of Mathematics, Caltech, Pasadena, USA 91125;Department of Mathematics, Caltech, Pasadena, USA 91125
Venue:
Designs, Codes and Cryptography
Year:
2006

Citing 8
Cited 3

Lopsided Lova´sz Local Lemma and Latin transversals

ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Extremal set systems

Handbook of combinatorics (vol. 2)
Upper bounds on permutation codes via linear programming

European Journal of Combinatorics
Intersecting families of permutations

European Journal of Combinatorics
Constructions for Permutation Codes in Powerline Communications

Designs, Codes and Cryptography
Constructions of permutation arrays

IEEE Transactions on Information Theory
Two constructions of permutation arrays

IEEE Transactions on Information Theory
Power line communications: state of the art and future trends

IEEE Communications Magazine

Bounds on permutation codes of distance four

Journal of Algebraic Combinatorics: An International Journal
Classes of permutation arrays in finite projective spaces

International Journal of Information and Coding Theory
Coding with injections

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

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.