On the generalization of $g$-circulant MDS matrices
Atif Ahmad Khan, Shakir Ali, Bhupendra Singh

TL;DR
This paper introduces a new class of consta-$g$-circulant matrices over finite fields, analyzes their invertibility and MDS properties, and provides explicit characterizations for small orders, enhancing understanding of their structure and applications.
Contribution
It extends $g$-circulant matrices to consta-$g$-circulant matrices, derives conditions for invertibility and MDS status, and characterizes small-order cases with new constructions inspired by skew polynomial rings.
Findings
Derived upper bounds for the existence of such matrices.
Provided conditions for invertibility and MDS property.
Characterized $g$-circulant MDS matrices of order 3 and 4.
Abstract
A matrix over the finite field is called \emph{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 \emph{consta--circulant matrix}, which extends the idea of -circulant matrices. These matrices come from a linear transformation defined by the polynomial over . 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 factors as where each \( f_i(x) \) is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Polynomial and algebraic computation
