A bound on permutation codes
zbMATH Open1295.05007MaRDI QIDQ396801FDOQ396801
Authors: Klaus Metsch, Jürgen 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40) Other finite linear geometries (51E26) Other types of codes (94B60)
Cites Work
- Improvement of Bruck's completion theorem
- Constructions for permutation codes in powerline communications
- Powerline communication and the 36 officers problem
- A survey on packing and covering problems in the Hamming permutation space
- Some \(t\)-homogeneous sets of permutations
- Finite nets. II: Uniqueness and imbedding
- An application of permutatation arrays to block ciphers
- A NEW NOTION OF TRANSITIVITY FOR GROUPS AND SETS OF PERMUTATIONS
- Theory of perpendicular arrays
- Isometries and Construction of Permutation Arrays
Cited In (11)
- New permutation codes using Hadamard unscrambling (Corresp.)
- Coding with injections
- Doubly resolvable canonical Kirkman packing designs and its applications
- Bounds on permutation codes of distance four
- Title not available (Why is that?)
- Permutation codes invariant under isometries
- Han's bijection via permutation codes
- A lower bound on permutation codes of distance \(n-1\)
- Nonexistence of perfect permutation codes under the Kendall \(\tau\)-metric
- Extremal solutions of an inequality concerning supports of permutation groups and punctured Hadamard codes
- New upper bounds for the size of permutation codes via linear programming
This page was built for publication: A bound on permutation codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q396801)
