Author:
Lim Enhui,Oggier Frédérique
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>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory,Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory
Reference17 articles.
1. E. F. Assmus, H. F. Mattson and R. J. Turyn, Research to Develop the Algebraic Theory of Codes, AFCRL-6700365, Air Force Cambridge Research Laboratories, Bedford, Massachusetts, 1967.
2. G. Berhuy, J. Fasel, O. Garotta.Rank weights for arbitrary finite field extensions, Advances in Mathematics of Communications, 15 (2021), 575-587.
3. J. Ducoat.Generalized rank weights: A duality statement, Amer. Math. Soc, 632 (2015), 101-109.
4. J. Ducoat and F. Oggier, Rank weight hierarchy of some classes of cyclic codes, IEEE Information Theory Workshop (ITW 2014), (2014), 142–146.
5. E. Gabidulin.Theory of codes with maximum rank distance (translation), Problems of Information Transmission, 21 (1985), 3-16.