Efficient Algorithms for Permutation Arrays from Permutation Polynomials

Sergey Bereg, Brian Malouf, Linda Morales, Ivan Hal Sudborough

Open source

DOI
10.3390/e27101031
Published
2025-10-01
Container
Entropy
Publisher
MDPI AG
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.3390/e27101031,
  title = {Efficient Algorithms for Permutation Arrays from Permutation Polynomials},
  author = {Sergey Bereg and Brian Malouf and Linda Morales and Ivan Hal Sudborough},
  year = {2025},
  journal = {Entropy},
  doi = {10.3390/e27101031},
  url = {https://doi.org/10.3390/e27101031}
}

RIS

TY  - JOUR
TI  - Efficient Algorithms for Permutation Arrays from Permutation Polynomials
AU  - Sergey Bereg
AU  - Brian Malouf
AU  - Linda Morales
AU  - Ivan Hal Sudborough
PY  - 2025
JO  - Entropy
DO  - 10.3390/e27101031
UR  - https://doi.org/10.3390/e27101031
ER  - 

APA

Bereg, S., Malouf, B., Morales, L., & Sudborough, I. H. (2025). Efficient Algorithms for Permutation Arrays from Permutation Polynomials. Entropy. https://doi.org/10.3390/e27101031

Source records