BINARY SUBSPACE CODES IN SMALL AMBIENT SPACES

Daniel Heinlein*, Sascha Kurz

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)

Abstract

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. Here we collect the present knowledge on lower and upper bounds for binary subspace codes for projective dimensions of at most 7, i.e., affine dimensions of at most 8. We obtain several improvements of the bounds and perform two classifications of optimal subspace codes, which are unknown so far in the literature.

Original languageEnglish
Pages (from-to)817-839
Number of pages23
JournalAdvances in Mathematics of Communications
Volume12
Issue number4
DOIs
Publication statusPublished - Nov 2018
MoE publication typeA1 Journal article-refereed

Keywords

  • Galois geometry
  • network coding
  • subspace code
  • partial spread
  • NETWORK ERROR-CORRECTION
  • CODING THEORY
  • LOWER BOUNDS
  • DIMENSION
  • DISTANCE
  • DESIGNS

Cite this