On sets of subspaces with two intersection dimensions and a geometrical junta bound

DOI10.1007/S10623-021-00931-2zbMATH Open1496.05018OpenAlexW3205463133WikidataQ114226828 ScholiaQ114226828MaRDI QIDQ2168073FDOQ2168073

Authors Giovanni Longobardi, Leo Storme, Rocco Trombetti

Publication date 31 August 2022

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.06792

zbMATH Keywords

extremal combinatoricssubspace codesGalois geometryrank codes

Mathematics Subject Classification ID

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

Abstract: In this article, constant dimension subspace codes whose codewords have subspace distance in a prescribed set of integers, are considered. The easiest example of such an object is a {it junta}; i.e. a subspace code in which all codewords go through a common subspace. We focus on the case when only two intersection values for the codewords, are assigned. In such a case we determine an upper bound for the dimension of the vector space spanned by the elements of a non-junta code. In addition, if the two intersection values are consecutive, we prove that such a bound is tight, and classify the examples attaining the largest possible dimension as one of four infinite families.

Recommendations

• On subspace codes
• On primitive constant dimension codes and a geometrical sunflower bound
• Johnson type bounds for mixed dimension subspace codes
• A note on equidistant subspace codes
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Coding for Errors and Erasures in Random Network Coding
• Equidistant codes in the Grassmannian
• Intersecting Families are Essentially Contained in Juntas
• On primitive constant dimension codes and a geometrical sunflower bound
• On sets of planes in projective spaces intersecting mutually in one point
• Subspace Codes
• The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces

Cited in

(2)

• On the intersection of two subgeometries of
• Properties of sets of subspaces with constant intersection dimension

This page was built for publication: On sets of subspaces with two intersection dimensions and a geometrical junta bound

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168073)