Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications
Reference33 articles.
1. Bereg S., Levy A., Sudborough I.H.: Constructing permutation arrays from groups. Des. Codes Cryptogr. 86(5), 1095–1111 (2018).
2. Bereg S., Malouf B., Morales L., Stanley T., Sudborough I.H.: Improved lower bounds for permutation arrays using permutation rational functions. In: Bajard J., Topuzoglu A. (eds.), 8th International Workshop on the Arithmetic of Finite Fields (WAIFI 2020), volume 12542 of Lecture Notes in Computer Science, pp. 234–252. Springer, (2020) https://doi.org/10.1007/978-3-030-68869-1_14.
3. 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).
4. Bereg S., Miller Z., Mojica L.G., Morales L., Sudborough I.H.: New lower bounds for permutation arrays using contraction. Des. Codes Cryptogr. 87, 2105–2128 (2019).
5. Bereg S., Mojica L.G., Morales L., Sudborough I.H.: Constructing permutation arrays using partition and extension. Des. Codes Cryptogr. 88(2), 311–339 (2020).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献