| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8903696 | Journal of Combinatorial Theory, Series A | 2018 | 28 Pages |
Abstract
Let C be a set of m by n matrices over Fq such that the rank of AâB is at least d for all distinct A,BâC. Suppose that m⩽n. If #C=qn(mâd+1), then C is a maximum rank distance (MRD for short) code. Until 2016, there were only two known constructions of MRD codes for arbitrary 1
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Guglielmo Lunardon, Rocco Trombetti, Yue Zhou,