Rank-metric codes as ideals for subspace codes and their weight properties
Let , a prime, a positive integer, and the Galois field with cardinality and characteristic . In this paper, we study some weight properties of rank-metric codes and subspace codes. The rank weight is not egalitarian nor homogeneous, and the rank weight distribution of is completely determined by th...
| Published in: | AKCE International Journal of Graphs and Combinatorics |
|---|---|
| Main Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2019-08-01
|
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2018.01.005 |
| Summary: | Let , a prime, a positive integer, and the Galois field with cardinality and characteristic . In this paper, we study some weight properties of rank-metric codes and subspace codes. The rank weight is not egalitarian nor homogeneous, and the rank weight distribution of is completely determined by the general linear group . We consider subspace weight that is defined on subspace codes and examine their egalitarian property. We also present some examples of rank-metric codes endowed with the rank distance and Grassmannian codes endowed with the subspace distance. These codes were generated from left ideals of using idempotent elements of . |
|---|---|
| ISSN: | 0972-8600 |