A welch–berlekamp like algorithm for decoding gabidulin codes
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Probabilistic crisscross error correction
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Maximum rank distance codes as space-time codes
IEEE Transactions on Information Theory
Isometries for rank distance and permutation group of Gabidulin codes
IEEE Transactions on Information Theory
Two-dimensional cluster-correcting codes
IEEE Transactions on Information Theory
On the Decoder Error Probability of Bounded Rank-Distance Decoders for Maximum RankDistance Codes
IEEE Transactions on Information Theory
Hi-index | 0.00 |
The MacWilliams identity, which relates the weight distribution of a code to the weight distribution of its dual code, is useful in determining the weight distribution of codes. In this paper, we derive the MacWilliams identity for linear codes with the rank metric, and our identity has a different form than that by Delsarte. Using our MacWilliams identity, we also derive related identities for rank metric codes. These identities parallel the binomial and power moment identities derived for codes with the Hamming metric.