On primitive constant dimension codes and a geometrical sunflower bound

Roland D. Barrolleta, Emilio Suárez-Canedo, Leo Storme, Peter Vandendriessche

    Research output: Contribution to journalArticleResearchpeer-review

    Abstract

    © 2017 AIMS. In this paper we study subspace codes with constant intersection dimension (SCIDs). We investigate the largest possible dimension spanned by such a code that can yield non-sunower codes, and classify the examples attaining equality in that bound as one of two infinite families. We also construct a new infinite family of primitive SCIDs.
    Original languageEnglish
    Pages (from-to)757-765
    JournalAdvances in Mathematics of Communications
    Volume11
    Issue number4
    DOIs
    Publication statusPublished - 1 Nov 2017

    Keywords

    • Constant intersection dimension codes
    • Finite geometry
    • Galois geometry
    • Rank codes
    • Subspace codes

    Fingerprint Dive into the research topics of 'On primitive constant dimension codes and a geometrical sunflower bound'. Together they form a unique fingerprint.

  • Cite this

    Barrolleta, R. D., Suárez-Canedo, E., Storme, L., & Vandendriessche, P. (2017). On primitive constant dimension codes and a geometrical sunflower bound. Advances in Mathematics of Communications, 11(4), 757-765. https://doi.org/10.3934/amc.2017055