Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares

DOI10.1109/TIT.2004.828150zbMath1296.94011OpenAlexW2148602768WikidataQ56069121 ScholiaQ56069121MaRDI QIDQ3546729

Charles J. Colbourn, Torleiv Kløve, Alan C. H. Ling

Publication date: 21 December 2008

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2004.828150

zbMATH Keywords

MOLSmutually orthogonal Latin squarespermutation codepermutation arraypowerline communicationsDoubly resolvable design

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Applications of design theory to circuits and networks (94C30) Communication theory (94A05)

Related Items (43)

On generalized Howell designs with block size three ⋮ On the construction of permutation arrays via mappings from binary vectors to permutations ⋮ A construction of optimal constant composition codes ⋮ Using permutation rational functions to obtain permutation arrays with large Hamming distance ⋮ The maximum clique problem for permutation Hamming graphs ⋮ Permutation codes with specified packing radius ⋮ The covering radius problem for sets of 1-factors of the complete uniform hypergraphs ⋮ New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD ⋮ A new metric on symmetric groups and applications to block permutation codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Construction of mutually unbiased bases using mutually orthogonal Latin squares ⋮ On the algebraic combinatorics of injections ⋮ Finite field constructions of combinatorial arrays ⋮ Re-encryption method designed by row complete matrix ⋮ Unnamed Item ⋮ Constructions of multi-permutation codes correcting a single burst of deletions ⋮ Room squares with super-simple property ⋮ Permutation polynomials with Carlitz rank 2 ⋮ Semidefinite programming for permutation codes ⋮ Optimal ternary constant-composition codes with weight four and distance three ⋮ Optimal ternary constant-composition codes with weight four and distance six ⋮ Improved lower bounds for permutation arrays using permutation rational functions ⋮ Constructing permutation arrays from groups ⋮ Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\) ⋮ The multicovering radius problem for some types of discrete structures ⋮ Extending permutation arrays: improving MOLS bounds ⋮ Coding with injections ⋮ A new and flexible method for constructing designs for computer experiments ⋮ On constant composition codes ⋮ Bounds on permutation codes of distance four ⋮ A lower bound on permutation codes of distance \(n-1\) ⋮ Constructing permutation arrays using partition and extension ⋮ On some permutation polynomials over $\mathbb {F}_q$ of the form $x^r h(x^{(q-1)/d})$ ⋮ Permutation binomials over finite fields ⋮ A new table of permutation codes ⋮ A note on good permutation codes from Reed-Solomon codes ⋮ New lower bounds for permutation arrays using contraction ⋮ Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications ⋮ 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

This page was built for publication: Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares