Pith. sign in

REVIEW

Wedge-Lifted Codes

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 2011.12435 v2 pith:MR5SSOOI submitted 2020-11-24 cs.IT math.IT

Wedge-Lifted Codes

classification cs.IT math.IT
keywords codeswedge-liftedbinarylocalityblockcodedefinedisjoint
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
abstract

We define wedge-lifted codes, a variant of lifted codes, and we study their locality properties. We show that (taking the trace of) wedge-lifted codes yields binary codes with the $t$-disjoint repair property ($t$-DRGP). When $t = N^{1/2d}$, where $N$ is the block length of the code and $d \geq 2$ is any integer, our codes give improved trade-offs between redundancy and locality among binary codes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.