Constructions for permutation codes in powerline communications
From MaRDI portal
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
(57)- Good permutation codes based on the shuffle-exchange network
- scientific article; zbMATH DE number 7790332 (Why is no real title available?)
- Approximate generalized Steiner systems and near-optimal constant weight codes
- Twisted permutation codes
- Error-correcting codes from permutation groups
- On the performance of permutation codes for multi-user communication
- Multiple contractions of permutation arrays
- Equidistant permutation group codes
- Semidefinite programming for permutation codes
- The remoteness of the permutation code of the group \(U_{6n}\)
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\)
- Special sequences as subcodes of Reed-Solomon codes
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Classes of permutation arrays in finite projective spaces
- Equidistant frequency permutation arrays and related constant composition codes
- A new metric on symmetric groups and applications to block permutation codes
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices
- Constructions of permutation arrays for certain scheduling cost measures
- A new table of permutation codes
- Frequency permutation arrays
- A bound on permutation codes
- New lower bounds for permutation arrays using contraction
- Gray code for permutations with a fixed number of cycles
- Using permutation rational functions to obtain permutation arrays with large Hamming distance
- Permutation codes with specified packing radius
- Decoding mixed errors and erasures in permutation codes
- The maximum clique problem for permutation Hamming graphs
- Constructing permutation arrays from groups
- Coding for locality in reconstructing permutations
- Coding with injections
- Constructions for retransmission permutation arrays
- On some connections between permutations and coding
- Room squares with super-simple property
- Permutation codes invariant under isometries
- Improved lower bounds for permutation arrays using permutation rational functions
- Error-correcting codes from \(k\)-resolving sets
- Cyclotomic Mapping Permutation Polynomials over Finite Fields
- On generalized Howell designs with block size three
- Increasing the minimum distance of codes by twisting
- Constructing permutation arrays using partition and extension
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- Finite field constructions of combinatorial arrays
- A random construction for permutation codes and the covering radius
- Bounds on permutation codes of distance four
- Diagonally neighbour transitive codes and frequency permutation arrays
- On constant composition codes
- New nonexistence results on perfect permutation codes under the Hamming metric
- Extending permutation arrays: improving MOLS bounds
- Commutative association schemes
- Optimal ternary constant-composition codes with weight four and distance six
- Constant composition codes as subcodes of linear codes
- Constructions of multi-permutation codes correcting a single burst of deletions
- Powerline communication and the 36 officers problem
- Decompositions of edge-colored digraphs: a new technique in the construction of constant-weight codes and related families
- Constructions of permutation arrays
- A note on good permutation codes from Reed-Solomon codes
- A lower bound on permutation codes of distance \(n-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)
