Using permutation rational functions to obtain permutation arrays with large Hamming distance

DOI10.1007/S10623-022-01039-XMaRDI QIDQ2153758zbMATH OpenOpenAlexWikidataFDO

Authors Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, I. H. Sudborough

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

zbMATH Keywords

Hamming distancepermutation polynomialspermutation codespermutation arrayspermutation rational functions

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Bounds on codes (94B65) Other types of codes (94B60)

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

Cites work

• 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 Improvement on the Gilbert–Varshamov Bound for Permutation Codes
• An application of permutatation arrays to block ciphers
• 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 Lower Bounds for Permutation Codes Using Linear Block Codes
• New bounds of permutation codes under Hamming metric and Kendall's \(\tau \)-metric
• New lower bounds for permutation arrays using contraction
• 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

Cited in

(4)

• Constructing permutation arrays from groups
• Improved lower bounds for permutation arrays using permutation rational functions
• A construction of product blocks with a fixed block size
• Distance-increasing mappings from binary vectors to permutations that increase hamming distances by at least two

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)