51367
A study of Superregular Matrices and MDS Codes
In this work we study the form and properties of the generator matrices of codes with a maximum and almost-maximum distance profile with the Hamming metric. We wrote programs to make tests on various linear codes, and found a relationship between the generalized Hamming distances of a code, and its systematic generator matrix.