Constructions of Batch Codes via Finite Geometry

01/20/2019
by   Nikita Polyanskii, et al.
0

A primitive k-batch code encodes a string x of length n into string y of length N, such that each multiset of k symbols from x has k mutually disjoint recovering sets from y. We develop new explicit and random coding constructions of linear primitive batch codes based on finite geometry. In some parameter regimes, our proposed codes have lower redundancy than previously known batch codes.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/03/2021

Improved batch code lower bounds

Batch codes are a useful notion of locality for error correcting codes, ...
research
10/05/2021

Lifted Reed-Solomon Codes and Lifted Multiplicity Codes

Lifted Reed-Solomon and multiplicity codes are classes of codes, constru...
research
09/13/2023

Bounds and Constructions for Generalized Batch Codes

Private information retrieval (PIR) codes and batch codes are two import...
research
01/29/2020

Array Codes for Functional PIR and Batch Codes

A functional PIR array code is a coding scheme which encodes some s info...
research
01/17/2021

Almost Optimal Construction of Functional Batch Codes Using Hadamard Codes

A functional k-batch code of dimension s consists of n servers storing l...
research
06/02/2018

Asynchronous Batch and PIR Codes from Hypergraphs

We propose a new model of asynchronous batch codes that allow for parall...
research
05/06/2019

Lifted multiplicity codes and the disjoint repair group property

Lifted Reed Solomon Codes (Guo, Kopparty, Sudan 2013) were introduced in...

Please sign up or login with your details

Forgot password? Click here to reset