Efficient Algorithms for Permutation Arrays from Permutation Polynomials.

Bereg S, Malouf B, Morales L, Sudborough IH

Open source

DOI
10.3390/e27101031
Published
2025 Oct 1
Container
Entropy (Basel, Switzerland)
Publisher
Not recorded
Open access
yes

Credibility signals

uncertain Score 53/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 = {Bereg S and Malouf B and Morales L and Sudborough IH},
  year = {2025},
  journal = {Entropy (Basel, Switzerland)},
  doi = {10.3390/e27101031},
  url = {https://doi.org/10.3390/e27101031}
}

RIS

TY  - JOUR
TI  - Efficient Algorithms for Permutation Arrays from Permutation Polynomials.
AU  - Bereg S
AU  - Malouf B
AU  - Morales L
AU  - Sudborough IH
PY  - 2025
JO  - Entropy (Basel, Switzerland)
DO  - 10.3390/e27101031
UR  - https://doi.org/10.3390/e27101031
ER  - 

APA

S, B., B, M., L, M., & IH, S. (2025). Efficient Algorithms for Permutation Arrays from Permutation Polynomials.. Entropy (Basel, Switzerland). https://doi.org/10.3390/e27101031

Source records