On primitive constant dimension codes and a geometrical sunflower bound | Zendy

Roland D. Barrolleta | Zendy; Emilio Suárez-Canedo | Zendy; Leo Storme | Zendy; Peter Vandendriessche | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On primitive constant dimension codes and a geometrical sunflower bound

Author(s) -

Roland D. Barrolleta,

Emilio Suárez-Canedo,

Leo Storme,

Peter Vandendriessche

Publication year - 2017

Publication title -

advances in mathematics of communications

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.601

H-Index - 26

eISSN - 1930-5346

pISSN - 1930-5338

DOI - 10.3934/amc.2017055

Subject(s) - mathematics , constant (computer programming) , sunflower , dimension (graph theory) , upper and lower bounds , pure mathematics , combinatorics , mathematical analysis , computer science , programming language

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research