Lifted Reed-Solomon Codes and Lifted Multiplicity Codes
Lukas Holzbaur, Rina Polyanskaya, Nikita Polyanskii, Ilya Vorobyev,, Eitan Yaakobi

TL;DR
This paper advances the theory of lifted Reed-Solomon and multiplicity codes by establishing new rate bounds, analyzing their asymptotic behavior, and demonstrating improved parameters for batch and PIR codes, along with a new local self-correction method.
Contribution
It provides improved lower bounds on the rate of lifted Reed-Solomon and multiplicity codes, analyzes their asymptotics, and introduces new constructions with better trade-offs for batch and PIR codes, plus a local self-correction algorithm.
Findings
New lower bounds on the rate of lifted Reed-Solomon codes for any number of variables.
Improved bounds on the rate and distance of lifted multiplicity codes for multiple variables.
Explicit construction of batch codes with better parameter trade-offs and improved PIR codes.
Abstract
Lifted Reed-Solomon and multiplicity codes are classes of codes, constructed from specific sets of -variate polynomials. These codes allow for the design of high-rate codes that can recover every codeword or information symbol from many disjoint sets. Recently, the underlying approaches have been combined for the bi-variate case to construct lifted multiplicity codes, a generalization of lifted codes that can offer further rate improvements. We continue the study of these codes by first establishing new lower bounds on the rate of lifted Reed-Solomon codes for any number of variables , which improve upon the known bounds for any . Next, we use these results to provide lower bounds on the rate and distance of lifted multiplicity codes obtained from polynomials in an arbitrary number of variables, which improve upon the known results for any . Specifically, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
