Resumen
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.
| Idioma original | English |
|---|---|
| Páginas (desde-hasta) | 525-540 |
| Número de páginas | 16 |
| Publicación | Advances in Mathematics of Communications |
| Volumen | 10 |
| N.º | 3 |
| DOI | |
| Estado | Published - ago 2016 |
Nota bibliográfica
Publisher Copyright:© 2016 AIMS.
Financiación
The first author was partially supported by the National Science Foundation grant #DMS-1210061.
| Financiadores | Número del financiador |
|---|---|
| National Science Foundation Arctic Social Science Program | -1210061 |
ASJC Scopus subject areas
- Algebra and Number Theory
- Computer Networks and Communications
- Discrete Mathematics and Combinatorics
- Applied Mathematics
Huella
Profundice en los temas de investigación de 'Construction of subspace codes through linkage'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver