2026-07-20T11:02:27Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:7592 2024-03-06T10:40:41Z ddc:004 open_access

Locality via Partially Lifted Codes Frank-Fischer, S. Luna Guruswami, Venkatesan Wootters, Mary Error correcting codes locality lifted codes In error-correcting codes, locality refers to several different ways of quantifying how easily a small amount of information can be recovered from encoded data. In this work, we study a notion of locality called the s-Disjoint-Repair-Group Property (s-DRGP). This notion can interpolate between two very different settings in coding theory: that of Locally Correctable Codes (LCCs) when s is large - a very strong guarantee - and Locally Recoverable Codes (LRCs) when s is small - a relatively weaker guarantee. This motivates the study of the s-DRGP for intermediate s, which is the focus of our paper. We construct codes in this parameter regime which have a higher rate than previously known codes. Our construction is based on a novel variant of the lifted codes of Guo, Kopparty and Sudan. Beyond the results on the s-DRGP, we hope that our construction is of independent interest, and will find uses elsewhere. Schloss Dagstuhl – Leibniz-Zentrum für Informatik S. Luna Frank-Fischer and Venkatesan Guruswami and Mary Wootters 2017 Is Part Of LIPIcs, Volume 81, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.APPROX-RANDOM.2017.43 urn:nbn:de:0030-drops-75922 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2017.43 eng https://creativecommons.org/licenses/by/3.0/legalcode