Abstract
A construction is discussed that allows to produce subspace codes of long length using subspace codes of shorter length in combination with a rank metric code. The subspace distance of the resulting linkage code is as good as the minimum subspace distance of the constituent codes. As a special application, the construction of the best known partial spreads is reproduced. Finally, for a special case of linkage, a decoding algorithm is presented which amounts to decoding with respect to the smaller constituent codes and which can be parallelized.
| Original language | English |
|---|---|
| Pages (from-to) | 525-540 |
| Number of pages | 16 |
| Journal | Advances in Mathematics of Communications |
| Volume | 10 |
| Issue number | 3 |
| DOIs | |
| State | Published - Aug 2016 |
Bibliographical note
Publisher Copyright:© 2016 AIMS.
Funding
The first author was partially supported by the National Science Foundation grant #DMS-1210061.
| Funders | Funder number |
|---|---|
| National Science Foundation Arctic Social Science Program | |
| Directorate for Mathematical and Physical Sciences | 1210061 |
Keywords
- Constant dimension subspace codes
- Partial spreads
- Random network coding
ASJC Scopus subject areas
- Algebra and Number Theory
- Computer Networks and Communications
- Discrete Mathematics and Combinatorics
- Applied Mathematics