A bound on permutation codes
From MaRDI portal
Publication:396801
zbMath1295.05007MaRDI QIDQ396801
Klaus Metsch, Juergen Bierbrauer
Publication date: 14 August 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v20i3p6
Permutations, words, matrices (05A05) Other types of codes (94B60) Combinatorial aspects of packing and covering (05B40) Other finite linear geometries (51E26)
Related Items (3)
A lower bound on permutation codes of distance \(n-1\) ⋮ Doubly resolvable canonical Kirkman packing designs and its applications ⋮ Permutation codes invariant under isometries
Cites Work
- Unnamed Item
- Improvement of Bruck's completion theorem
- Constructions for permutation codes in powerline communications
- Some \(t\)-homogeneous sets of permutations
- A survey on packing and covering problems in the Hamming permutation space
- Finite nets. II: Uniqueness and imbedding
- A NEW NOTION OF TRANSITIVITY FOR GROUPS AND SETS OF PERMUTATIONS
- Theory of perpendicular arrays
- Isometries and Construction of Permutation Arrays
- Powerline communication and the 36 officers problem
This page was built for publication: A bound on permutation codes
