A random construction for permutation codes and the covering radius

被引：16

作者：

Keevash, Peter ^{[1
]}

Ku, Cheng Yeaw ^{[1
]}

机构：

[1] CALTECH, Dept Math, Pasadena, CA 91125 USA

来源：

DESIGNS CODES AND CRYPTOGRAPHY | 2006年 / 41卷 / 01期

关键词：

permutation codes; covering radius; restricted intersections;

D O I：

10.1007/s10623-006-0017-3

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We analyse a probabilistic argument that gives a semi-random construction for a permutation code on n symbols with distance n-s and size Theta(s!(log n)(1/2)), and a bound on the covering radius for sets of permutations in terms of a certain frequency parameter.

引用

页码：79 / 86

页数：8

共 15 条

[1]

Alon N., 2000, PROBABILISTIC METHOD

[2]

Babai L., 1992, Linear Algebra Methods in Combinatorics: With Applications to Geometry and Computer Science

[3] Covering radius for sets of permutations [J].