MacWilliams Identity for the Rank Metric

This paper investigates the relationship between the rank weight distribution of a linear code and that of its dual code. The main result of this paper is that, similar to the MacWilliams identity for the Hamming metric, the rank weight distribution of any linear code can be expressed as an analytical expression of that of its dual code. Remarkably, our new identity has a similar form to the MacWilliams identity for the Hamming metric. Our identity is also closely related to Delsarte's MacWilliams identity for the q-distance. We use a linear space based approach in the proof for our new identity, and adapt this approach to provide an alternative proof of the MacWilliams identity for the Hamming metric. Finally, we determine the relationship between moments of the rank distribution of a linear code and those of its dual code, and provide an alternative derivation of the rank weight distribution of maximum rank distance codes.

[1]  Thierry P. Berger,et al.  Isometries for rank distance and permutation group of Gabidulin codes , 2003, IEEE Trans. Inf. Theory.

[2]  Ernst M. Gabidulin,et al.  Ideals over a Non-Commutative Ring and thier Applications in Cryptology , 1991, EUROCRYPT.

[3]  G. Andrews.  The Theory of Partitions: Frontmatter , 1976 .

[4]  Ron M. Roth,et al.  Author's Reply to Comments on 'Maximum-rank array codes and their application to crisscross error correction' , 1991, IEEE Trans. Inf. Theory.

[5]  Ron M. Roth,et al.  Probabilistic crisscross error correction , 1997, IEEE Trans. Inf. Theory.

[6]  H. Keng,et al.  A THEOREM ON MATRICES OVER A SFIELD AND ITS APPLICATIONS , 1951 .

[7]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[8]  Philippe Delsarte,et al.  Bilinear Forms over a Finite Field, with Applications to Coding Theory , 1978, J. Comb. Theory A.

[9]  Ernst M. Gabidulin,et al.  On subcodes of codes in rank metric , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[10]  A. Robert Calderbank,et al.  Space-Time Codes for High Data Rate Wireless Communications : Performance criterion and Code Construction , 1998, IEEE Trans. Inf. Theory.

[11]  W. B. Vasantha,et al.  Multi-covering radii of codes with rank metric , 2002, Proceedings of the IEEE Information Theory Workshop.

[12]  Martin Bossert,et al.  Maximum rank distance codes as space-time codes , 2003, IEEE Trans. Inf. Theory.

[13]  Ernst M. Gabidulin,et al.  The new construction of rank codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[14]  Emil Grosswald,et al.  The Theory of Partitions , 1984 .

[15]  U. Sripati,et al.  On the rank distance of cyclic codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[16]  Mizan Rahman,et al.  Basic Hypergeometric Series , 1990 .

[17]  Pierre Loidreau,et al.  Properties of codes in rank metric , 2006, ArXiv.