Pith. sign in

REVIEW

On the minimum number of minimal codewords

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 1912.09804 v1 pith:KKQZCQYH submitted 2019-12-20 math.CO

Romar dela Cruz , Michael Kiermaier , Sascha Kurz , Alfred Wassermann This is my paper · ORCID
classification math.CO
keywords minimalcodewordsminimumnumberboundscasescodesderive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We study the minimum number of minimal codewords in linear codes from the point of view of projective geometry. We derive bounds and in some cases determine the exact values. We also present an extension to minimal subcode supports.

Discussion (0). Continue with ORCID to comment.

Pith tools