Constructions for permutation codes in powerline communications
From MaRDI portal
Permutation codes do not enjoy the popularity of binary codes though these have been studied for many years, and have been found useful in powerline communication. In this paper, several new computational constructions of permutation codes are given. Most of these make use of automorphism groups. It is shown that certain families of polynomials over finite fields give rise to permutation arrays. The main result of the paper is a recursive construction of such arrays for codes with constant weight composition. A listing and comparison of various old and new lower bounds of such a study is provided.
Recommendations
- LDPC code design for nonuniform power-line channels
- Improving a power line communications standard with LDPC codes
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- On the performance of permutation codes for multi-user communication
- Codes in Permutations and Error Correction for Rank Modulation
- Generalized balanced tournament packings and optimal equitable symbol weight codes for power line communications
- An iterative code construction and codes generated by permutations for the asymmetric multiple-access channel (Corresp.)
- Permutation codes for the Laplacian source (Corresp.)
Cited in
(63)- Commutative association schemes
- Error-correcting codes from permutation groups
- On some connections between permutations and coding
- Increasing the minimum distance of codes by twisting
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Coding for locality in reconstructing permutations
- Error-correcting codes from \(k\)-resolving sets
- Constructing permutation arrays from groups
- Constant composition codes as subcodes of linear codes
- Equidistant permutation group codes
- Using permutation rational functions to obtain permutation arrays with large Hamming distance
- The maximum clique problem for permutation Hamming graphs
- Improved lower bounds for permutation arrays using permutation rational functions
- Decoding mixed errors and erasures in permutation 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
- A note on good permutation codes from Reed-Solomon codes
- New lower bounds for permutation arrays using contraction
- Twisted permutation codes
- Permutation codes invariant under isometries
- Room squares with super-simple property
- Semidefinite programming for permutation codes
- Diagonally neighbour transitive codes and frequency permutation arrays
- On the performance of permutation codes for multi-user communication
- On constant composition codes
- Constructions of multi-permutation codes correcting a single burst of deletions
- On generalized Howell designs with block size three
- Frequency permutation arrays
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Permutation codes with specified packing radius
- A bound on permutation codes
- Constructions of permutation arrays for certain scheduling cost measures
- Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
- Constructions of permutation arrays
- Optimal ternary constant-composition codes with weight four and distance six
- The remoteness of the permutation code of the group \(U_{6n}\)
- Extending permutation arrays: improving MOLS bounds
- Powerline communication and the 36 officers problem
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
- A new metric on symmetric groups and applications to block permutation codes
- New nonexistence results on perfect permutation codes under the Hamming metric
- Good permutation codes based on the shuffle-exchange network
- Multiple contractions of permutation arrays
- scientific article; zbMATH DE number 7790332 (Why is no real title available?)
- Classes of permutation arrays in finite projective spaces
- Approximate generalized Steiner systems and near-optimal constant weight codes
- Bounds for permutation arrays under Kendall tau metric
- Asymptotically optimal constant weight codes with even distance
- Coding with injections
- Constructions for retransmission permutation arrays
- Upper bounds on the size of permutation codes with a Hamming distance of five
- Tilings of \(\mathcal{H}_q(n,w)\) with optimal \((n,d,w)_q\)-codes
- New lower bounds for permutation codes in the Ulam metric
- Constructing permutation codes under the generalized Kendall- metric
- Special sequences as subcodes of Reed-Solomon codes
- A new table of permutation codes
- Equidistant frequency permutation arrays and related constant composition codes
- A random construction for permutation codes and the covering radius
- Gray code for permutations with a fixed number of cycles
- Finite field constructions of combinatorial arrays
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
This page was built for publication: Constructions for permutation codes in powerline communications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877339)
