A random construction for permutation codes and the covering radius
type: Item
instance of: scholarly article
title: A random construction for permutation codes and the covering radius
zbMATH Open document ID: 1200.94058
author: Peter Keevash
author: Cheng Yeaw Ku
published in: Designs, Codes and Cryptography
publication date: 2006-11-22T00:00:00Z
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 94B75
Mathematics Subject Classification ID: 05D40
zbMATH DE Number: 5075359
zbMATH Keywords: Permutation codes
zbMATH Keywords: Covering radius
zbMATH Keywords: Restricted intersections
MaRDI profile type: Publication
full work available at URL: s10623-006-0017-3
OpenAlex ID: W2162296398
cites work: Intersecting families of permutations
cites work: Covering radius for sets of permutations
cites work: Constructions for permutation codes in powerline communications
cites work: On the maximum number of permutations with given maximal or minimal distance
cites work: Constructions of permutation arrays
cites work: INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
cites work: Lopsided Lovász Local lemma and Latin transversals
cites work: Two Constructions of Permutation Arrays
cites work: Upper bounds on permutation codes via linear programming
DOI: 10.1007/S10623-006-0017-3
description: scientific article; zbMATH DE number 5075359