On the generalization of g-circulant MDS matrices
Abstract
A matrix M over the finite field Fq is called maximum distance separable (MDS) if all of its square submatrices are non-singular. These MDS matrices are very important in cryptography and coding theory because they provide strong data protection and help spread information efficiently. In this paper, we introduce a new type of matrix called a consta-g-circulant matrix, which extends the idea of g-circulant matrices. These matrices come from a linear transformation defined by the polynomial h(x) = xm - λ + Σi=0m-1 hi xi over Fq . We find the upper bound of such matrices exist and give conditions to check when they are invertible. This helps us know when they are MDS matrices. If the polynomial xm - λ factors as xm - λ = Πi=1t fi(x)ei, where each \( fi(x) \) is irreducible, then the number of invertible consta-g-circulant matrices is N · Πi=1t ( q fi - 1 ), where r is the multiplicative order of λ, and \( N \) is the number of integers \( k \) such that 0 ≤ k < m - 1r + 1 and (1 + rk, m) = 1. This formula help us to reduce the number of cases to check whether such matrices is MDS. Moreover, we give complete characterization of g-circulant MDS matrices of order 3 and 4. Additionally, inspired by skew polynomial rings, we construct a new variant of g-circulant matrix. In the last, we provide some examples related to our findings.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.