Web of Science: 0 citations, Scopus: 0 citations, Google Scholar: citations
On primitive constant dimension codes and a geometrical sunflower bound
Barrolleta, Roland David (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Storme, Leo (Universiteit Gent. Department of Mathematics)
Suárez Canedo, E. (Universitat Autònoma de Barcelona. Departament d'Enginyeria de la Informació i de les Comunicacions)
Vandendriessche, Peter (Universiteit Gent. Department of Mathematics)

Date: 2017
Abstract: 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-sunflower 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.
Note: Altres ajuts: COST project Random Network Coding and Designs over GF(q) (COST IC-1104)
Note: Número d'acord de subvenció MEC/TIN2013-40524-P
Note: Número d'acord de subvenció AGAUR/2014/SGR-691
Rights: Tots els drets reservats
Language: Anglès.
Document: article ; recerca ; acceptedVersion
Subject: Subspace codes ; Constant intersection dimension codes ; Rank codes ; Finite geometry ; Galois geometry
Published in: Advances in mathematics of communications, Vol. 11, issue 4 (2017) , p. 757-765, ISSN 1930-5346

DOI: 10.3934/amc.2017055


Post-print
9 p, 1.5 MB

The record appears in these collections:
Research literature > UAB research groups literature > Research Centres and Groups (scientific output) > Engineering > Combinatorics, Coding and Security Group (CCSG)
Articles > Research articles
Articles > Published articles

 Record created 2018-03-13, last modified 2019-02-02



   Favorit i Compartir