REVIEW 1 cited by
LRCs: Duality, LP Bounds, and Field Size
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
read the original abstract
We develop a duality theory of locally recoverable codes (LRCs) and apply it to establish a series of new bounds on their parameters. We introduce and study a refined notion of weight distribution that captures the code's locality. Using a duality result analogous to a MacWilliams identity, we then derive an LP-type bound that improves on the best known bounds in several instances. Using a dual distance bound and the theory of generalized weights, we obtain non-existence results for optimal LRCs over small fields. In particular, we show that an optimal LRC must have both minimum distance and block length relatively small compared to the field size.
Forward citations
Cited by 1 Pith paper
-
Bounds for Pure Disjoint $(r,\delta)$-Quantum Locally Recoverable Codes
New Singleton-like and linear-programming dimension bounds are proven for disjoint quantum locally recoverable codes under a blockwise purity condition.
Discussion (0). Continue with ORCID to comment.