Construction of subspace codes through linkage

Research output: Contribution to journalArticlepeer-review

44 Scopus citations

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 languageEnglish
Pages (from-to)525-540
Number of pages16
JournalAdvances in Mathematics of Communications
Volume10
Issue number3
DOIs
StatePublished - Aug 2016

Bibliographical note

Publisher Copyright:
© 2016 AIMS.

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

Fingerprint

Dive into the research topics of 'Construction of subspace codes through linkage'. Together they form a unique fingerprint.

Cite this