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

weight enumeratorcovering radiusmatroidsassociation schemesPermutation groupsupport enumerator

Mathematics Subject Classification ID

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

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

• 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?)
• 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
• 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

(18)

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

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)