Pith. sign in

REVIEW

Remarks on generalized toric 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 1107.4530 v2 pith:JSNBO54S submitted 2011-07-22 cs.IT math.AGmath.IT

John B. Little This is my paper · ORCID
classification cs.ITmath.AGmath.IT
keywords codecorrespondinggeneralizedtoricdistanceminimumsomewill
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

This note presents some new information on how the minimum distance of the generalized toric code corresponding to a fixed set of integer lattice points S in R^2 varies with the base field. The main results show that in some cases, over sufficiently large fields, the minimum distance of the code corresponding to a set S will be the same as that of the code corresponding to the convex hull of S. In an example, we will also discuss a [49,12,28] generalized toric code over GF(8), better than any previously known code according to M. Grassl's online tables, as of July 2011.

Discussion (0). Continue with ORCID to comment.

Pith tools