Pith. sign in

REVIEW 1 cited by

A recursive construction for projective Reed-Muller 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 2312.05072 v2 pith:ZRQO25QO submitted 2023-12-08 cs.IT math.ACmath.IT

Rodrigo San-José This is my paper · ORCID
classification cs.ITmath.ACmath.IT
keywords codesreed-mullerprojectiveconstructionrecursivegiveaffinebound
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We give a recursive construction for projective Reed-Muller codes in terms of affine Reed-Muller codes and projective Reed-Muller codes in fewer variables. From this construction, we obtain the dimension of the subfield subcodes of projective Reed-Muller codes for some particular degrees that give codes with good parameters. Moreover, from this recursive construction we derive a lower bound for the generalized Hamming weights of projective Reed-Muller codes which is sharp in most of the cases we have checked.

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. The weight hierarchy of decreasing norm-trace codes

    cs.IT 2024-11 conditional novelty 6.0 of 10

    The complete weight hierarchy of every decreasing norm-trace code is determined by a footprint maximization, recovering the Hermitian hierarchy as a special case.

Pith tools