Rank distribution of Delsarte codes

October 05, 2015 ยท Declared Dead ยท ๐Ÿ› Designs, Codes and Cryptography

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Javier de la Cruz, Elisa Gorla, Hiram H. Lopez, Alberto Ravagnani arXiv ID 1510.01008 Category cs.IT: Information Theory Citations 46 Venue Designs, Codes and Cryptography Last Checked 3 months ago
Abstract
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.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Theory

Died the same way โ€” ๐Ÿ‘ป Ghosted