Pages that link to "Item:Q3546729"
From MaRDI portal
The following pages link to Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares (Q3546729):
Displaying 45 items.
- On generalized Howell designs with block size three (Q306349) (← links)
- Permutation codes with specified packing radius (Q356723) (← links)
- Optimal ternary constant-composition codes with weight four and distance six (Q482203) (← links)
- Extending permutation arrays: improving MOLS bounds (Q521869) (← links)
- Coding with injections (Q690670) (← links)
- A new table of permutation codes (Q766240) (← links)
- On the construction of permutation arrays via mappings from binary vectors to permutations (Q851743) (← links)
- A construction of optimal constant composition codes (Q851744) (← 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)
- A new and flexible method for constructing designs for computer experiments (Q973874) (← links)
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric (Q1675288) (← links)
- Optimal ternary constant-composition codes with weight four and distance three (Q1727782) (← links)
- Constructing permutation arrays from groups (Q1744019) (← links)
- Constructions for permutation codes in powerline communications (Q1877339) (← links)
- Re-encryption method designed by row complete matrix (Q1954746) (← links)
- Permutation binomials over finite fields (Q2065904) (← 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)
- Construction of mutually unbiased bases using mutually orthogonal Latin squares (Q2190566) (← links)
- On the algebraic combinatorics of injections (Q2199901) (← links)
- Permutation polynomials with Carlitz rank 2 (Q2219946) (← links)
- Improved lower bounds for permutation arrays using permutation rational functions (Q2232223) (← links)
- The multicovering radius problem for some types of discrete structures (Q2248636) (← 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)
- Doubly resolvable canonical Kirkman packing designs and its applications (Q2334086) (← links)
- Permutation codes invariant under isometries (Q2345924) (← links)
- Some new resolvable GDDs with \(k = 4\) and doubly resolvable GDDs with \(k = 3\) (Q2352077) (← links)
- Optimal almost equisymbol codes based on difference matrices (Q2352634) (← links)
- The covering radius problem for sets of 1-factors of the complete uniform hypergraphs (Q2407022) (← links)
- Room squares with super-simple property (Q2448082) (← links)
- Semidefinite programming for permutation codes (Q2449151) (← links)
- On constant composition codes (Q2492193) (← links)
- Constructions of multi-permutation codes correcting a single burst of deletions (Q2701501) (← links)
- On some permutation polynomials over $\mathbb {F}_q$ of the form $x^r h(x^{(q-1)/d})$ (Q3631823) (← links)
- Quantization of high dimensional Gaussian vector using permutation modulation with application to information reconciliation in continuous variable QKD (Q4584398) (← links)
- Generalized Balanced Tournament Packings and Optimal Equitable Symbol Weight Codes for Power Line Communications (Q5249059) (← links)
- Some new classes of zero-difference balanced functions and related constant composition codes (Q6039833) (← 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)
- Nonexistence of perfect permutation codes under the $$\ell _{\infty }$$-metric (Q6489327) (← links)