Using permutation rational functions to obtain permutation arrays with large Hamming distance
DOI10.1007/S10623-022-01039-XzbMATH Open1498.05003OpenAlexW4283212063WikidataQ114849754 ScholiaQ114849754MaRDI QIDQ2153758FDOQ2153758
Brian Malouf, Linda Morales, I. H. Sudborough, Thomas Stanley, Sergey Bereg
Publication date: 13 July 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01039-x
Recommendations
- 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
Hamming distancepermutation polynomialspermutation codespermutation arrayspermutation rational functions
Cites Work
- Permutation polynomials over finite fields -- a survey of recent advances
- Constructions for permutation codes in powerline communications
- Permutation Arrays for Powerline Communication and Mutually Orthogonal Latin Squares
- Powerline communication and the 36 officers problem
- When Does a Polynomial over a Finite Field Permute the Elements of the Field?, II
- A new table of permutation codes
- Permutation polynomials and orthomorphism polynomials of degree six
- An application of permutatation arrays to block ciphers
- Improved lower bounds for permutation arrays using permutation rational functions
- New lower bounds for permutation arrays using contraction
- Permutation codes invariant under isometries
- An Improvement on the Gilbert–Varshamov Bound for Permutation Codes
- Extending permutation arrays: improving MOLS bounds
- Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2
- New Lower Bounds for Permutation Codes Using Linear Block Codes
- On a type of permutation rational functions over finite fields
- Low-degree permutation rational functions over finite fields
- Constructing permutation arrays from groups
- New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
- A classification of permutation polynomials of degree 7 over finite fields
- Full classification of permutation rational functions and complete rational functions of degree three over finite fields
- Constructing permutation arrays using partition and extension
- A note on good permutation codes from Reed-Solomon codes
- Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation
- Isometry invariant permutation codes and mutually orthogonal Latin squares
Cited In (1)
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)
