Coding with injections

DOI10.1007/S10623-011-9547-4zbMATH Open1254.05006OpenAlexW2012176224MaRDI QIDQ690670FDOQ690670

Authors: Peter Dukes 

Publication date: 28 November 2012

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-011-9547-4

Recommendations

• Bounds on permutation codes of distance four
• Permutation codes with specified packing radius
• Constructions of permutation arrays
• Upper bounds on permutation codes via linear programming
• A bound on permutation codes

zbMATH Keywords

Hamming distancearrangementpermutation codeordered designpacking injection

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40) Convolutional codes (94B10)

Cites Work

• The CRC handbook of combinatorial designs
• Title not available (Why is that?)
• On the maximum number of permutations with given maximal or minimal distance
• Bounds for permutation arrays
• Constructions for permutation codes in powerline communications
• Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
• Upper bounds on permutation codes via linear programming
• Title not available (Why is that?)
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• A random construction for permutation codes and the covering radius

Cited In (5)

• Permutation codes
• Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
• Diagonally neighbour transitive codes and frequency permutation arrays
• Semidefinite programming for permutation codes
• On the algebraic combinatorics of injections

Uses Software

• GRAPE

This page was built for publication: Coding with injections

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