Recursive MDS matrices over finite commutative rings (Q2231784): Difference between revisions

A matrix is an MDS matrix if the function \(f\) represented by the matrix has the property that \(\{(x, f (x))\}\) is a Maximum Distance Separable Code, that is, it is a code that meets the Singleton bound \(d = n - k + 1\). These matrices have useful applications in cryptography. A matrix \(L\) is said to be recursive MDS if the matrix \(L^r\) is an MDS matrix. The authors give several construction methods for recursive MDS companion matrices over finite commutative rings. They give a simple form for the determinant of a linearized matrix over a finite commutative ring with prime characteristic. Examples are given of recursive MDS companion matrices over local rings with even characteristic.