2025/07/01 by Berhuy, G., Molina, J.
#FOS: Computer and information sciences #Information Theory (cs.IT)
paper · doi:10.48550/arxiv.2507.00609
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.