Brian Malouf

According to our database, Brian Malouf authored at least 6 papers between 2019 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Bounds for permutation arrays under Kendall Tau metric.

Sergey Bereg, William Bumpass, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough

Discret. Math. Algorithms Appl., January, 2026

2025

Efficient Algorithms for Permutation Arrays from Permutation Polynomials.

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

Entropy, 2025

2024

Improved bounds for permutation arrays under Chebyshev distance.

Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough

Des. Codes Cryptogr., April, 2024

2022

Using permutation rational functions to obtain permutation arrays with large hamming distance.

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

Des. Codes Cryptogr., 2022

2020

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions.

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

Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019

Equivalence Relations for Computing Permutation Polynomials.

Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough, Alexander Wong

CoRR, 2019