Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
From MaRDI portal
Recommendations
Cited in
(49)- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Optimal ternary constant-composition codes with weight four and distance three
- Constructing permutation arrays from groups
- Constructions for permutation codes in powerline communications
- Re-encryption method designed by row complete matrix
- Permutation binomials over finite fields
- Using permutation rational functions to obtain permutation arrays with large Hamming distance
- The maximum clique problem for permutation Hamming graphs
- Construction of mutually unbiased bases using mutually orthogonal Latin squares
- On the algebraic combinatorics of injections
- Permutation polynomials with Carlitz rank 2
- Improved lower bounds for permutation arrays using permutation rational functions
- The multicovering radius problem for some types of discrete structures
- Bounds on permutation codes of distance four
- A lower bound on permutation codes of distance \(n-1\)
- Constructing permutation arrays using partition and extension
- A note on good permutation codes from Reed-Solomon codes
- New lower bounds for permutation arrays using contraction
- Doubly resolvable canonical Kirkman packing designs and its applications
- Permutation codes invariant under isometries
- Some new resolvable GDDs with \(k = 4\) and doubly resolvable GDDs with \(k = 3\)
- Optimal almost equisymbol codes based on difference matrices
- The covering radius problem for sets of 1-factors of the complete uniform hypergraphs
- Room squares with super-simple property
- Semidefinite programming for permutation codes
- On constant composition codes
- Constructions of multi-permutation codes correcting a single burst of deletions
- On generalized Howell designs with block size three
- Permutation codes with specified packing radius
- On some permutation polynomials over $\mathbb {F}_q$ of the form $x^r h(x^{(q-1)/d})$
- Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD
- Optimal ternary constant-composition codes with weight four and distance six
- Extending permutation arrays: improving MOLS bounds
- Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications
- Powerline communication and the 36 officers problem
- scientific article; zbMATH DE number 7688182 (Why is no real title available?)
- A new metric on symmetric groups and applications to block permutation codes
- New nonexistence results on perfect permutation codes under the Hamming metric
- Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric
- Coding with injections
- Improvements for lower bounds of mutually orthogonal Latin squares of sizes 54, 96 and 108
- Upper bounds on the size of permutation codes with a Hamming distance of five
- Constructions of quintuple constant-composition codes with weight four and distance three
- A new table of permutation codes
- On the construction of permutation arrays via mappings from binary vectors to permutations
- A construction of optimal constant composition codes
- Finite field constructions of combinatorial arrays
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- A new and flexible method for constructing designs for computer experiments
This page was built for publication: Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546729)
