Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes
type: Item
instance of: scholarly article
title: Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes
zbMATH Open document ID: 1468.51002
author: Daniele Bartoli
author: P. Vandendriessche
author: Ago-Erik Riet
author: Leo Storme
published in: Journal of Geometry
publication date: 2021-06-24T00:00:00Z
review text: An equidistant constant dimension subspace code (\((k,t)\)-SCID) \(C\) consists of a set of \(k\)-dimensional subspaces of a vector space over a finite field such that each pair intersect in a subspace of a fixed dimension \(t\). The classical example of such a code is a set of \(k\)-spaces, passing through a fixed \(t\)-space, which is called a sunflower. The authors improve the sunflower bound by proving the following. If \( |C| \geq \left(\frac{q^k-q}{q-1}\right)^2 + \frac{q^k-q}{q-1}-q^{k-1}\), then \(C\) is a sunflower.
reviewed by: Steven T. Dougherty
Mathematics Subject Classification ID: 51E20
Mathematics Subject Classification ID: 05B25
Mathematics Subject Classification ID: 94B60
zbMATH DE Number: 7362844
zbMATH Keywords: subspace codes
zbMATH Keywords: \(q\)-analogue problems
zbMATH Keywords: Erdős-Ko-Rado
zbMATH Keywords: random network coding
MaRDI profile type: Publication
full work available at URL: s00022-021-00572-9
OpenAlex ID: W3127492527
cites work: Partial spreads in finite projective spaces and partial designs
cites work: On sets of planes in projective spaces intersecting mutually in one point
cites work: On sets of \(n\)-dimensional subspaces of projective spaces intersecting mutually in an \((n-2)\)-dimensional subspace
cites work: Equidistant codes in the Grassmannian
cites work: Q4370894
cites work: Q4003762
cites work: Coding for Errors and Erasures in Random Network Coding
cites work: Partial \(t\)-spreads in \(\text{PG}(2t+1,q)\)
DOI: 10.1007/S00022-021-00572-9
description: scientific article; zbMATH DE number 7362844