On the rank weight hierarchy of $M$-codes
By: G. Berhuy, J. Molina
Potential Business Impact:
Finds better ways to send secret messages.
We study the rank weight hierarchy of linear codes which are stable under a linear endomorphism defined over the base field, in particular when the endomorphism is cyclic. In this last case, we give a necessary and sufficient condition for such a code to have first rank weight equal to $1$ in terms of its generator polynomial, as well as an explicit formula for its last rank weight.
Similar Papers
Complete weight enumerators and weight hierarchies for linear codes from quadratic forms
Information Theory
Creates new codes for better error correction.
The complete weight distribution of a family of irreducible cyclic codes of dimension two
Information Theory
Finds hidden patterns in secret codes.
One-weight codes in the sum-rank metric
Information Theory
Makes secret messages harder to break.