Subspaces intersecting in at most a point (Q2302159): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q126653014, #quickstatements; #temporary_batch_1722372779079
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3105624231 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1907.02728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subspace code constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subspace codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bilinear forms over a finite field, with applications to coding theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes and Designs Related to Lifted MRD Codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classifying optimal binary subspace codes of length 8, constant dimension 4 and minimum distance 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Putative <i>q</i>-Analogues of the Fano Plane and Related Combinatorial Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal binary subspace codes of length 6, constant dimension 3 and minimum subspace distance 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding for Errors and Erasures in Random Network Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Rank-Metric Approach to Error Control in Random Network Coding / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126653014 / rank
 
Normal rank

Latest revision as of 22:04, 30 July 2024

scientific article
Language Label Description Also known as
English
Subspaces intersecting in at most a point
scientific article

    Statements

    Subspaces intersecting in at most a point (English)
    0 references
    0 references
    25 February 2020
    0 references
    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.\]
    0 references
    constant dimension codes
    0 references
    finite projective geometry
    0 references
    network coding
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references