Pith. sign in

REVIEW

Johnson type bounds for mixed dimension subspace 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 1808.03580 v3 pith:QSC2G2YR submitted 2018-08-10 math.CO

Thomas Honold , Michael Kiermaier , Sascha Kurz This is my paper · ORCID
classification math.CO
keywords codesboundsdimensionjohnsonsubspaceappliedboundcardinalities
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Subspace codes, i.e., sets of subspaces of $\mathbb{F}_q^v$, are applied in random linear network coding. Here we give improved upper bounds for their cardinalities based on the Johnson bound for constant dimension codes.

Discussion (0). Continue with ORCID to comment.

Pith tools