Pith. sign in

REVIEW 1 cited by

Generalized linkage construction for constant-dimension codes

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1910.11195 v3 pith:N2VUZL65 submitted 2019-10-24 math.CO

Daniel Heinlein This is my paper · ORCID
classification math.CO
keywords constructionlinkagecdcsconstant-dimensiongeneralizedimprovedboundedbounds
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

A constant-dimension code (CDC) is a set of subspaces of constant dimension in a common vector space with upper bounded pairwise intersection. We improve and generalize two constructions for CDCs, the improved linkage construction and the parallel linkage construction, to the generalized linkage construction which in turn yields many improved lower bounds for the cardinalities of CDCs; a quantity not known in general.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. New Constructions of Subspace Codes Using Subsets of MRD codes in Several Blocks

    cs.IT 2019-08 conditional novelty 6.0 of 10

    Parallel versions of the linkage construction and of multi-block lifted MRD codes yield new lower bounds on A_q(n,d,k), beating the previous tables in more than 110 cases.

Pith tools