Name
Abstract | ||
|---|---|---|
This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension of a rank-metric code with given specified Ferrers diagram shape and rank distance. While the conjecture in its generality is wide open, several cases have been established in the literature. This paper contributes further cases of Ferrers diagrams and ranks for which the conjecture holds true. In addition, probabilities for maximal Ferrers diagram codes and MRD codes are investigated. It is shown that for growing field size the limiting probability for the event that randomly chosen matrices with given shape generate a maximal Ferrers diagram code, depends highly on the Ferrers diagram. For instance, for [m x 2]-MRD codes with rank 2 this limiting probability is close to 1/e. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/TIT.2019.2926256 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
Limiting,Shape,Measurement,Task analysis,Conferences,Information theory | Discrete mathematics,Subspace topology,Upper and lower bounds,Matrix (mathematics),Diagram,Conjecture,Mathematics,Limiting,Generality | Journal |
Volume | Issue | ISSN |
abs/1804.00624 | 10 | 0018-9448 |
Citations | PageRank | References |
1 | 0.35 | 13 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jared Antrobus | 1 | 1 | 0.69 |
| Heide Gluesing-Luerssen | 2 | 69 | 12.81 |