Permutation codes
From MaRDI portal
Publication:966159
DOI10.1016/j.ejc.2009.03.044zbMath1196.94081OpenAlexW2914567979MaRDI QIDQ966159
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
Permutations, words, matrices (05A05) Linear codes (general theory) (94B05) Algebraic combinatorics (05E99) Extremal set theory (05D05) Combinatorial aspects of matroids and geometric lattices (05B35) General theory for finite permutation groups (20B05)
Related Items (5)
Good permutation codes based on the shuffle-exchange network ⋮ The covering radius of permutation designs ⋮ Remoteness of permutation codes ⋮ Error-correcting codes from \(k\)-resolving sets ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An inequality for finite permutation groups
- Uncoverings-by-bases for base-transitive permutation groups.
- Error-correcting codes from permutation groups
- Sharp permutation groups
- 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
- Bases for permutation groups and matroids
- The proportion of fixed-point-free elements of a transitive permutation group
- Coding with permutations
- On Permutation Geometries
- Minimum bases for permutation groups: The greedy approximation
- Weight Enumeration and the Geometry of Linear Codes
- Independence Algebras
- Four fundamental parameters of a code and their combinatorial significance
- Distance Enumerators for Permutation Groups
- Intersecting families of permutations
- Cycle index, weight enumerator, and Tutte polynomial
This page was built for publication: Permutation codes
