MacWilliams Identity for the Rank Metric
| dc.creator | Gadouleau, Maximilien | |
| dc.creator | Yan, Zhiyuan | |
| dc.date | 2007-01-16 | |
| dc.date.accessioned | 2026-07-07T08:16:58Z | |
| dc.date.available | 2026-07-07T08:16:58Z | |
| dc.description | 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 new identity provides a significant analytical tool to the rank weight distribution analysis of linear codes. 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. | |
| dc.description | 5 pages, submitted to IEEE ISIT 2007 | |
| dc.identifier | https://arxiv.org/abs/cs/0701097 | |
| dc.identifier | http://arxiv.org/abs/cs/0701097 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/133973 | |
| dc.subject | Information Theory | |
| dc.title | MacWilliams Identity for the Rank Metric | |
| dc.type | text |