Constructions for permutation codes in powerline communications
From MaRDI portal
Publication:1877339
DOI10.1023/B:DESI.0000029212.52214.71zbMath1065.94003OpenAlexW2066218472MaRDI QIDQ1877339
Wensong Chu, Charles J. Colbourn, Peter J. Dukes
Publication date: 16 August 2004
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:desi.0000029212.52214.71
heuristic searchreactive local searchpermutation polynomialpermutation codeconstant composition codepermutation array
Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Polynomials over finite fields (11T06) Source coding (94A29)
Related Items (45)
On generalized Howell designs with block size three ⋮ Equidistant frequency permutation arrays and related constant composition codes ⋮ A random construction for permutation codes and the covering radius ⋮ 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 ⋮ Increasing the minimum distance of codes by twisting ⋮ Gray code for permutations with a fixed number of cycles ⋮ New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric ⋮ A bound on permutation codes ⋮ A new metric on symmetric groups and applications to block permutation codes ⋮ New nonexistence results on perfect permutation codes under the Hamming metric ⋮ Multiple contractions of permutation arrays ⋮ Coding for locality in reconstructing permutations ⋮ Finite field constructions of combinatorial arrays ⋮ Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families ⋮ Constructions of multi-permutation codes correcting a single burst of deletions ⋮ Error-correcting codes from \(k\)-resolving sets ⋮ Unnamed Item ⋮ Room squares with super-simple property ⋮ Semidefinite programming for permutation codes ⋮ Diagonally neighbour transitive codes and frequency permutation arrays ⋮ 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}\) ⋮ Extending permutation arrays: improving MOLS bounds ⋮ Coding with injections ⋮ Decoding mixed errors and erasures in permutation codes ⋮ Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices ⋮ Constant composition codes as subcodes of linear codes ⋮ On constant composition codes ⋮ Bounds on permutation codes of distance four ⋮ Cyclotomic Mapping Permutation Polynomials over Finite Fields ⋮ A lower bound on permutation codes of distance \(n-1\) ⋮ Constructing permutation arrays using partition and extension ⋮ Unnamed Item ⋮ Special sequences as subcodes of Reed-Solomon codes ⋮ A new table of permutation codes ⋮ Commutative association schemes ⋮ A note on good permutation codes from Reed-Solomon codes ⋮ New lower bounds for permutation arrays using contraction ⋮ Error-correcting codes from permutation groups ⋮ Equidistant permutation group codes ⋮ Permutation codes invariant under isometries
This page was built for publication: Constructions for permutation codes in powerline communications
