Using permutation rational functions to obtain permutation arrays with large Hamming distance
Let \(\pi\) and \(\sigma\) be permutations over \(n\) symbols. The Hamming distance between \(\pi\) and \(\sigma\), denoted by \(\operatorname{hd}(\pi, \sigma)\), is the number of positions \(x\) such that \(\pi(x) \neq \sigma(x)\). Then the Hamming distance of a permutation array (PA) \(A\) is defined by \(\operatorname{hd}(A) = \min \{ \operatorname{hd}(\pi, \sigma) \mid \pi, \sigma \in A, \pi \neq \sigma \}\). Let \(M(n, D)\) denote the maximum number of permutations in any PA \(A\) on \(n\) symbols with Hamming distance \(D\). Let \(q\) be a prime power. Previously, lower bounds for \(M(q, D)\) for some \(q\) and \(D\) were obtained using PAs constructed by permutation polynomials of bounded degree. Recently, permutation rational functions (PRF) are also used to compute some improved lower bound for \(M(q, D)\) and \(M(q+1, D)\). This paper extends previous work on PAs with large Hamming distance and PRFs and gives improved lower bounds for \(M(q, D)\) and \(M(q+1, D)\). More explicitly, they use PRFs of specified degree \(d\) to obtain an improved lower bound for \(M(q, q-k)\) such that \(k\in \{5, 6, 7, 8, 9\}\), and for \(M(q+1, q-k)\) such that \(k\in \{4, 5, 6, 7, 8, 9\}\).
- Improved lower bounds for permutation arrays using permutation rational functions
- Constructing permutation arrays using partition and extension
- Constructing permutation arrays from groups
- Permutation codes with specified packing radius
- On a conjecture on permutation rational functions over finite fields
- A classification of permutation polynomials of degree 7 over finite fields
- A new table of permutation codes
- A note on good permutation codes from Reed-Solomon codes
- An application of permutatation arrays to block ciphers
- An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
- Constructing permutation arrays from groups
- Constructing permutation arrays using partition and extension
- Constructions for permutation codes in powerline communications
- Extending permutation arrays: improving MOLS bounds
- Full classification of permutation rational functions and complete rational functions of degree three over finite fields
- Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation
- Improved lower bounds for permutation arrays using permutation rational functions
- Isometry invariant permutation codes and mutually orthogonal Latin squares
- Low-degree permutation rational functions over finite fields
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- New lower bounds for permutation arrays using contraction
- New Lower Bounds for Permutation Codes Using Linear Block Codes
- On a type of permutation rational functions over finite fields
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Permutation codes invariant under isometries
- Permutation polynomials and orthomorphism polynomials of degree six
- Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2
- Permutation polynomials over finite fields -- a survey of recent advances
- Powerline communication and the 36 officers problem
- When Does a Polynomial over a Finite Field Permute the Elements of the Field?, II
- Constructing permutation arrays from groups
- Improved lower bounds for permutation arrays using permutation rational functions
- Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two
- A construction of product blocks with a fixed block size
- Upper bounds on the size of permutation codes with a Hamming distance of five
This page was built for publication: Using permutation rational functions to obtain permutation arrays with large Hamming distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2153758)
