Abstract
Cryptography and coding theory are the important areas where Maximum Distance Separable (MDS) matrices are used extensively. The Pascal matrix plays vital role in combinatorics, matrix theory and its properties provide interesting combinatorial identities. Pascal matrices also have a wide range of applications in cryptography. In this paper, we define Pascal-like rhotrix, and further, we construct MDS Pascal-like rhotrices over finite fields.
Recommended Citation
Dhiman, Neetu; Harish, Mansi; Gupta, Shalini; and Chauhan, Arun
(2024).
On Constructions of Maximum Distance Separable Pascal-Like Rhotrices over Finite Fields,
Applications and Applied Mathematics: An International Journal (AAM), Vol. 19,
Iss.
3, Article 9.
Available at:
https://digitalcommons.pvamu.edu/aam/vol19/iss3/9