Subspaces intersecting in at most a point

DOI10.1007/S10623-019-00699-6MaRDI QIDQ2302159zbMATH OpenOpenAlexWikidataFDO

Authors Sascha Kurz

Publication date 25 February 2020

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

Full work available at URL https://arxiv.org/abs/1907.02728, https://epub.uni-bayreuth.de/4417/1/Subspaces_intersecting_point.pdf

zbMATH Keywords

constant dimension codesfinite projective geometrynetwork coding

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Combinatorial structures in finite projective spaces (51E20) Bounds on codes (94B65)

Abstract: We improve on the lower bound of the maximum number of planes in $operatornamePG(8,q)cong{F}_q^9$ pairwise intersecting in at most a point. In terms of constant dimension codes this leads to $A_q(9,4;3)ge{q}^{12}+2q^8+2q^7+q^6+2q^5+2q^4-2q^2-2q+1$. This result is obtained via a more general construction strategy, which also yields other improvements.

Review text

The author finds a new lower bound on the maximum number of planes in \(\mathrm{PG}(8,q)\) pairwise intersecting in at most a single point. This result has direct consequences for constant dimension codes, namely it follows that \[A_q(9,4;3) \geq q^{12} + 2q^8 + 2q^7 + q^6 + 2q^5 + 2q^4 -2q^2 -2q +1.\]

Recommendations

• Subspace code constructions
• On the sunflower bound for \(k\)-spaces, pairwise intersecting in a point
• How many \(s\)-subspaces must miss a point set in \(\mathrm{PG}(d, q)\)
• On subspace codes
• A note on equidistant subspace codes

Cites work

• A Rank-Metric Approach to Error Control in Random Network Coding
• Bilinear forms over a finite field, with applications to coding theory
• Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6
• Codes and Designs Related to Lifted MRD Codes
• Coding for Errors and Erasures in Random Network Coding
• On putative q-analogues of the Fano plane and related combinatorial structures
• On subspace codes
• Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4
• Subspace code constructions

Cited in

(6)

• Subspace code constructions
• On the sunflower bound for \(k\)-spaces, pairwise intersecting in a point
• Subspaces intersecting each element of a regulus in one point, André-Bruck-Bose representation and clubs
• Intersection of Two Invariant Subspaces
• The interplay of different metrics for the construction of constant dimension codes
• Combining subspace codes

This page was built for publication: Subspaces intersecting in at most a point

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