Pith. sign in

REVIEW 1 cited by

Codes with Hierarchical Locality on Artin-Schreier Surfaces

Not yet reviewed by Pith; the record is open.

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 2405.19533 v2 pith:B6FTQ3DM submitted 2024-05-29 math.NT

classification math.NT
keywords codeshierarchicalartin-schreierlocalitymathbbparameterssurfacesurfaces
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this article, we construct codes with hierarchical locality using natural geometric structures in Artin-Schreier surfaces of the form $y^p-y=f(x,z)$. Our main theorem describes the codes, their hierarchical structure and recovery algorithms, and gives parameters. We also develop a family of examples using codes defined over $\mathbb{F}_{p^2}$ on the surface $y^p-y=x^{p+1}z^2+x^2z^{p+1}$. We use elementary methods to count the $\mathbb{F}_{p^2}$-rational points on the surface, enabling us to provide explicit hierarchical parameters and a better bound on minimum distance for these codes. An additional example and some generalizations are also considered.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Locally Recoverable Codes with availability from a family of fibered surfaces

    math.AG 2025-12 conditional novelty 6.0 of 10

    A new family of locally recoverable codes with availability 2 is built by evaluating functions on points of a curve M_r inside the fibered surface E_r; for locality r=3 the minimum-distance lower bound is sharp.

Pith tools