Permutation codes

DOI10.1016/J.EJC.2009.03.044MaRDI QIDQ966159zbMATH OpenOpenAlexFDO

Authors Peter J. Cameron

Publication date 27 April 2010

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2009.03.044

zbMATH Keywords

association schemescovering radiusmatroidsPermutation groupsupport enumeratorweight enumerator

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of matroids and geometric lattices (05B35) Extremal set theory (05D05) Algebraic combinatorics (05E99) General theory for finite permutation groups (20B05) Linear codes (general theory) (94B05)

Review text

There are many analogies between sets of subsets and sets of permutations. This paper is a survey of old and new results about sets (and groups) of permutations concentrating on the analogies and of the relations to coding theory. Several open problems related to algebraic structures, extremal permutation theory and permutation groups as codes are described.

Recommendations

• Equidistant permutation group codes
• Sharp sets of permutations
• Geometric sets of permutations
• Upper bounds on permutation codes via linear programming
• Coding with injections

Cites work

• An inequality for finite permutation groups
• Bases for permutation groups and matroids
• Coding with permutations
• Covering radius for sets of permutations
• Cycle index, weight enumerator, and Tutte polynomial
• Distance Enumerators for Permutation Groups
• Error-correcting codes from permutation groups
• Four fundamental parameters of a code and their combinatorial significance
• scientific article; zbMATH DE number 5130691 (Why is no real title available?)
• scientific article; zbMATH DE number 4164879 (Why is no real title available?)
• scientific article; zbMATH DE number 3957072 (Why is no real title available?)
• scientific article; zbMATH DE number 47598 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• Independence Algebras
• Intersecting families of permutations
• Minimum bases for permutation groups: The greedy approximation
• On Permutation Geometries
• On the maximum number of permutations with given maximal or minimal distance
• Ordering classes of matrices of 0's and 1's
• Sharp permutation groups
• The proportion of fixed-point-free elements of a transitive permutation group
• Uncoverings-by-bases for base-transitive permutation groups.
• Upper bounds on permutation codes via linear programming
• Weight Enumeration and the Geometry of Linear Codes

Cited in

(20)

• On some connections between permutations and coding
• Geometric sets of permutations
• Sharp sets of permutations
• Error-correcting codes from \(k\)-resolving sets
• Equidistant permutation group codes
• Permutation codes invariant under isometries
• The covering radius of permutation designs
• Invariant sets under permutation, extremal graphs, and covering codes
• New permutation codes using Hadamard unscrambling (Corresp.)
• Permutation codes for the Laplacian source (Corresp.)
• Generation, Ranking and Unranking of Permutations based on the Mixed-Radix Codes
• Generating cyclically permutable codes (Corresp.)
• Remoteness of permutation codes
• The remoteness of the permutation code of the group \(U_{6n}\)
• Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
• Good permutation codes based on the shuffle-exchange network
• Han's bijection via permutation codes
• Intersection density of imprimitive groups of degree \(pq\)
• New lower bounds for permutation codes in the Ulam metric
• Constructing permutation codes under the generalized Kendall- metric

This page was built for publication: Permutation codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q966159)