Subspace Codes Based on Graph Matchings, Ferrers Diagrams, and Pending Blocks

Natalia Silberstein, Anna Lena Trautmann

Research output: Contribution to journalArticlepeer-review

48 Scopus citations

Abstract

This paper provides new constructions and lower bounds for subspace codes, using Ferrers diagram rank-metric codes from matchings of the complete graph and pending blocks. We present different constructions for constant dimension codes with minimum injection distance 2 or k-1 , where k is the constant dimension. Furthermore, we present a construction of new codes from old codes for any minimum distance. Then, we construct nonconstant dimension codes from these codes. Some examples of codes obtained by these constructions are the largest known codes for the given parameters.

Original languageEnglish
Article number7110586
Pages (from-to)3937-3953
Number of pages17
JournalIEEE Transactions on Information Theory
Volume61
Issue number7
DOIs
StatePublished - 1 Jul 2015
Externally publishedYes

Keywords

  • Constant dimension codes
  • Ferrers diagram rank-metric codes
  • Grassmannian
  • graph matchings
  • subspace codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this