Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

MacWilliams identity for codes with the rank metric.

Gadouleau, Maximilien and Yan, Zhiyuan (2008) 'MacWilliams identity for codes with the rank metric.', EURASIP journal on wireless communications and networking., 2008 . p. 754021.

Abstract

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.

Item Type:Article
Additional Information:Special issue: Advances in Error Control Coding Techniques
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
(630Kb)
Status:Peer-reviewed
Publisher Web site:http://dx.doi.org/10.1155/2008/754021
Publisher statement:© 2008 The Author(s). This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Date accepted:03 March 2008
Date deposited:29 October 2015
Date of first online publication:March 2008
Date first made open access:No date available

Save or Share this output

Export:
Export
Look up in GoogleScholar