Pages that link to "Item:Q1877339"
From MaRDI portal
The following pages link to Constructions for permutation codes in powerline communications (Q1877339):
Displaying 44 items.
- On generalized Howell designs with block size three (Q306349) (← links)
- Permutation codes with specified packing radius (Q356723) (← links)
- A bound on permutation codes (Q396801) (← links)
- Optimal ternary constant-composition codes with weight four and distance six (Q482203) (← links)
- Extending permutation arrays: improving MOLS bounds (Q521869) (← links)
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices (Q543906) (← links)
- Coding with injections (Q690670) (← links)
- Special sequences as subcodes of Reed-Solomon codes (Q764087) (← links)
- A new table of permutation codes (Q766240) (← links)
- Equidistant frequency permutation arrays and related constant composition codes (Q849359) (← links)
- A random construction for permutation codes and the covering radius (Q851770) (← links)
- Gray code for permutations with a fixed number of cycles (Q879329) (← links)
- Finite field constructions of combinatorial arrays (Q908047) (← links)
- Constructions of optimal GDRP\((n,\lambda ;v)\)'s of type \(\lambda^1\mu^{m - 1}\) (Q948688) (← links)
- Commutative association schemes (Q1039424) (← links)
- Error-correcting codes from permutation groups (Q1043942) (← links)
- Increasing the minimum distance of codes by twisting (Q1671660) (← links)
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric (Q1675288) (← links)
- Coding for locality in reconstructing permutations (Q1696052) (← links)
- Error-correcting codes from \(k\)-resolving sets (Q1717187) (← links)
- Constructing permutation arrays from groups (Q1744019) (← links)
- Constant composition codes as subcodes of linear codes (Q2008052) (← links)
- Equidistant permutation group codes (Q2099153) (← links)
- Using permutation rational functions to obtain permutation arrays with large Hamming distance (Q2153758) (← links)
- The maximum clique problem for permutation Hamming graphs (Q2156387) (← links)
- Improved lower bounds for permutation arrays using permutation rational functions (Q2232223) (← links)
- Decoding mixed errors and erasures in permutation codes (Q2256109) (← links)
- Bounds on permutation codes of distance four (Q2269535) (← links)
- A lower bound on permutation codes of distance \(n-1\) (Q2285776) (← links)
- Constructing permutation arrays using partition and extension (Q2291664) (← links)
- A note on good permutation codes from Reed-Solomon codes (Q2324769) (← links)
- New lower bounds for permutation arrays using contraction (Q2324789) (← links)
- Permutation codes invariant under isometries (Q2345924) (← links)
- Room squares with super-simple property (Q2448082) (← links)
- Semidefinite programming for permutation codes (Q2449151) (← links)
- Diagonally neighbour transitive codes and frequency permutation arrays (Q2454089) (← links)
- On constant composition codes (Q2492193) (← links)
- Constructions of multi-permutation codes correcting a single burst of deletions (Q2701501) (← links)
- Decompositions of Edge-Colored Digraphs: A New Technique in the Construction of Constant-Weight Codes and Related Families (Q4611006) (← links)
- (Q5122710) (← links)
- Cyclotomic Mapping Permutation Polynomials over Finite Fields (Q5448565) (← links)
- A new metric on symmetric groups and applications to block permutation codes (Q6041587) (← links)
- New nonexistence results on perfect permutation codes under the Hamming metric (Q6047439) (← links)
- Multiple contractions of permutation arrays (Q6083967) (← links)
