Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes

DOI10.1007/s00022-021-00572-9zbMath1468.51002OpenAlexW3127492527MaRDI QIDQ2035132

Peter Vandendriessche, Daniele Bartoli, Storme, L., Ago-Erik Riet

Publication date: 24 June 2021

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00022-021-00572-9

zbMATH Keywords

subspace codesrandom network codingErdős-Ko-Rado\(q\)-analogue problems

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Other types of codes (94B60) Combinatorial structures in finite projective spaces (51E20)

Related Items (3)

Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space ⋮ On the sunflower bound for \(k\)-spaces, pairwise intersecting in a point ⋮ LCD subspace codes

Cites Work

• Unnamed Item
• Unnamed Item
• Partial spreads in finite projective spaces and partial designs
• Partial \(t\)-spreads in \(\text{PG}(2t+1,q)\)
• On sets of planes in projective spaces intersecting mutually in one point
• On sets of \(n\)-dimensional subspaces of projective spaces intersecting mutually in an \((n-2)\)-dimensional subspace
• Equidistant codes in the Grassmannian
• Coding for Errors and Erasures in Random Network Coding

This page was built for publication: Improvement to the sunflower bound for a class of equidistant constant dimension subspace codes