Related papers: A note on MDS Property of Circulant Matrices
Circulant Maximum Distance Separable (MDS) matrices have gained significant importance due to their applications in the diffusion layer of the AES block cipher. In $2013$, Gupta and Ray established that circulant involutory matrices of…
In symmetric cryptography, maximum distance separable (MDS) matrices with computationally simple inverses have wide applications. Many block ciphers like AES, SQUARE, SHARK, and hash functions like PHOTON use an MDS matrix in the diffusion…
A matrix $M$ over the finite field $ \mathbb{F}_q $ 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…
Maximum Distance Separable (MDS) matrices play a central role in coding theory and symmetric-key cryptography due to their optimal diffusion properties. In this paper, we present a construction of MDS matrices using skew polynomial rings \(…
In $1998,$ Daemen {\it{ et al.}} introduced a circulant Maximum Distance Separable (MDS) matrix in the diffusion layer of the Rijndael block cipher, drawing significant attention to circulant MDS matrices. This block cipher is now…
Maximum distance separable (MDS) matrices play a crucial role not only in coding theory but also in the design of block ciphers and hash functions. Of particular interest are involutory MDS matrices, which facilitate the use of a single…
MDS matrices play a critical role in the design of diffusion layers for block ciphers and hash functions due to their optimal branch number. Involutory and orthogonal MDS matrices offer additional benefits by allowing identical or nearly…
Two of many criteria of a good MDS matrix are being involutory and having few different elements. This paper investigates the number of different entries in an involutory MDS matrices of order 1, 2, 3, and 4 over finite fields of…
The optimal branch number of MDS matrices has established their importance in designing diffusion layers for various block ciphers and hash functions. As a result, numerous matrix structures, including Hadamard and circulant matrices, have…
A linear code with parameters of the form $[n, k, n-k+1]$ is referred to as an MDS (maximum distance separable) code. A linear code with parameters of the form $[n, k, n-k]$ is said to be almost MDS (i.e., almost maximum distance separable)…
In this paper, we develop the theory of convolutional codes over finite commutative chain rings. In particular, we focus on maximum distance profile (MDP) convolutional codes and we provide a characterization of these codes, generalizing…
Properties of matrix product codes over finite commutative Frobenius rings are investigated. The minimum distance of matrix product codes constructed with several types of matrices is bounded in different ways. The duals of matrix product…
Maximum-distance separable (MDS) convolutional codes are characterized by the property that their free distance reaches the generalized Singleton bound. In this paper, new criteria to construct MDS convolutional codes are presented.…
Let $p$ be a prime and $s,m,n$ be positive integers. This paper studies quasi-recursive MDS matrices over Galois rings $GR(p^{s}, p^{sm})$ and proposes various direct construction methods for such matrices. The construction is based on skew…
Maximum distance separable convolutional codes are the codes that present best performance in error correction among all convolutional codes with certain rate and degree. In this paper, we show that taking the constant matrix coefficients…
We show that the free distance, as a function on a space parameterizing a family of convolutional codes, is a lower-semicontinuous function and that, therefore, the property of being Maximum Distance Separable (MDS) is an open condition.…
We study the existence over small fields of Maximum Distance Separable (MDS) codes with generator matrices having specified supports (i.e. having specified locations of zero entries). This problem unifies and simplifies the problems posed…
It is known that maximum distance separable and maximum distance profile convolutional codes exist over large enough finite fields of any characteristic for all parameters $(n,k,\delta)$. It has been conjectured that the same is true for…
This paper considers the problem of designing maximum distance separable (MDS) codes over small fields with constraints on the support of their generator matrices. For any given $m\times n$ binary matrix $M$, the GM-MDS conjecture, due to…
Maximum distance separable convolutional codes are characterized by the property that the free distance reaches the generalized Singleton bound, which makes them optimal for error correction. However, the existing constructions of such…