Coding with injections
From MaRDI portal
Publication:690670
DOI10.1007/s10623-011-9547-4zbMath1254.05006OpenAlexW2012176224MaRDI QIDQ690670
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
Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40) Convolutional codes (94B10)
Related Items (4)
On the algebraic combinatorics of injections ⋮ Semidefinite programming for permutation codes ⋮ Diagonally neighbour transitive codes and frequency permutation arrays ⋮ Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A random construction for permutation codes and the covering radius
- On the maximum number of permutations with given maximal or minimal distance
- Bounds for permutation arrays
- Upper bounds on permutation codes via linear programming
- Constructions for permutation codes in powerline communications
- On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
This page was built for publication: Coding with injections