Rank distribution of Delsarte codes
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2015
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916116534657024 |
|---|---|
| author | de la Cruz, Javier Gorla, Elisa Lopez, Hiram H. Ravagnani, Alberto |
| author_facet | de la Cruz, Javier Gorla, Elisa Lopez, Hiram H. Ravagnani, Alberto |
| contents | In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank distribution of such codes is determined by their parameters. This extends a result by Delsarte on the rank distribution of MRD codes. In the general case of codes of positive defect, we show that the rank distribution is determined by the parameters of the code, together the number of codewords of small rank. Moreover, we prove that if the rank defect of a code and its dual are both one, and the dimension satisfies a divisibility condition, then the number of minimum-rank codewords and dual minimum-rank codewords is the same. Finally, we discuss how our results specialize to Gabidulin codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1510_01008 |
| institution | arXiv |
| publishDate | 2015 |
| record_format | arxiv |
| spellingShingle | Rank distribution of Delsarte codes de la Cruz, Javier Gorla, Elisa Lopez, Hiram H. Ravagnani, Alberto Information Theory 2010: 94B60, 94C99, 68P30 In analogy with the Singleton defect for classical codes, we propose a definition of rank defect for Delsarte rank-metric codes. We characterize codes whose rank defect and dual rank defect are both zero, and prove that the rank distribution of such codes is determined by their parameters. This extends a result by Delsarte on the rank distribution of MRD codes. In the general case of codes of positive defect, we show that the rank distribution is determined by the parameters of the code, together the number of codewords of small rank. Moreover, we prove that if the rank defect of a code and its dual are both one, and the dimension satisfies a divisibility condition, then the number of minimum-rank codewords and dual minimum-rank codewords is the same. Finally, we discuss how our results specialize to Gabidulin codes. |
| title | Rank distribution of Delsarte codes |
| topic | Information Theory 2010: 94B60, 94C99, 68P30 |
| url | https://arxiv.org/abs/1510.01008 |