On the generalised rank weights of quasi-cyclic codes

Abstract

<p style='text-indent:20px;'>Generalised rank weights were formulated in analogy to Wei's generalised Hamming weights, but for the rank metric. In this paper we study the generalised rank weights of quasi-cyclic codes, a special class of linear codes usually studied for their properties in error correction over the Hamming metric. By using the algebraic structure of quasi-cyclic codes, a new upper bound on the generalised rank weights of quasi-cyclic codes is formulated, which is tighter than the known Singleton bound. Additionally, it is shown that the first generalised rank weight of self-dual <inline-formula><tex-math id="M1">\begin{document}$ 1 $\end{document}</tex-math></inline-formula>-generator quasi-cyclic codes is almost completely determined by the choice of <inline-formula><tex-math id="M2">\begin{document}$ {\mathbb F}_{q^{m}} $\end{document}</tex-math></inline-formula>.</p>