Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions-Reference-Cited by-同舟云学术

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions

Published:2021 Issue: Volume: Page:234-252
ISSN:0302-9743
Container-title:Arithmetic of Finite Fields
language:
Short-container-title:

Author:

Bereg Sergey^ORCID,Malouf Brian^ORCID,Morales Linda^ORCID,Stanley Thomas^ORCID,Sudborough I. Hal^ORCID

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-68869-1_14

Reference23 articles.

1. Bereg, S., Levy, A., Sudborough, I.H.: Constructing permutation arrays from groups. Des. Codes Crypt. 86(5), 1095–1111 (2017). https://doi.org/10.1007/s10623-017-0381-1

2. Bereg, S., Malouf, B., Morales, L., Stanley, T., Sudborough, I.H., Wong, A.: Equivalence relations for computing permutation polynomials. arXiv e-prints arXiv:1911.12823 (2019)

3. Bereg, S., Miller, Z., Mojica, L.G., Morales, L., Sudborough, I.H.: New lower bounds for permutation arrays using contraction. Des. Codes Crypt. 87(9), 2105–2128 (2019). https://doi.org/10.1007/s10623-019-00607-y

4. Bereg, S., Mojica, L.G., Morales, L., Sudborough, H.: Constructing permutation arrays using partition and extension. Des. Codes Crypt. 88(2), 311–339 (2019). https://doi.org/10.1007/s10623-019-00684-z

5. Bereg, S., Morales, L., Sudborough, I.H.: Extending permutation arrays: improving MOLS bounds. Des. Codes Crypt. 83(3), 661–683 (2016). https://doi.org/10.1007/s10623-016-0263-y

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multiple contractions of permutation arrays;Journal of Algebraic Combinatorics;2023-06-14

2. Using permutation rational functions to obtain permutation arrays with large hamming distance;Designs, Codes and Cryptography;2022-06-20