A random construction for permutation codes and the covering radius
From MaRDI portal
Publication:851770
DOI10.1007/s10623-006-0017-3zbMath1200.94058OpenAlexW2162296398MaRDI QIDQ851770
Publication date: 22 November 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-006-0017-3
Combinatorial codes (94B25) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (10)
The covering radius problem for sets of 1-factors of the complete uniform hypergraphs ⋮ All group‐based latin squares possess near transversals ⋮ Semidefinite programming for permutation codes ⋮ Diagonally neighbour transitive codes and frequency permutation arrays ⋮ The multicovering radius problem for some types of discrete structures ⋮ Coding with injections ⋮ Covering radius in the Hamming permutation space ⋮ Bounds on permutation codes of distance four ⋮ Covering radius of permutation groups with infinity-norm ⋮ New lower bounds for permutation arrays using contraction
Cites Work
- Lopsided Lovász Local lemma and Latin transversals
- On the maximum number of permutations with given maximal or minimal distance
- Upper bounds on permutation codes via linear programming
- Covering radius for sets of permutations
- Constructions for permutation codes in powerline communications
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- Two Constructions of Permutation Arrays
- Constructions of permutation arrays
- Intersecting families of permutations
This page was built for publication: A random construction for permutation codes and the covering radius
