Improved batch code lower bounds

06/03/2021
by   Ray Li, et al.
0

Batch codes are a useful notion of locality for error correcting codes, originally introduced in the context of distributed storage and cryptography. Many constructions of batch codes have been given, but few lower bound (limitation) results are known, leaving gaps between the best known constructions and best known lower bounds. Towards determining the optimal redundancy of batch codes, we prove a new lower bound on the redundancy of batch codes. Specifically, we study (primitive, multiset) linear batch codes that systematically encode n information symbols into N codeword symbols, with the requirement that any multiset of k symbol requests can be obtained in disjoint ways. We show that such batch codes need Ω(√(Nk)) symbols of redundancy, improving on the previous best lower bounds of Ω(√(N)+k) at all k=n^ε with ε∈(0,1). Our proof follows from analyzing the dimension of the order-O(k) tensor of the batch code's dual code.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/13/2023

Bounds and Constructions for Generalized Batch Codes

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

Constructions of Batch Codes via Finite Geometry

A primitive k-batch code encodes a string x of length n into string y of...
research
02/02/2018

On taking advantage of multiple requests in error correcting codes

In most notions of locality in error correcting codes -- notably locally...
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
12/24/2017

Duplication-Correcting Codes

In this work, we propose constructions that correct duplications of mult...
research
01/06/2019

Bounds on the Length of Functional PIR and Batch codes

A functional k-PIR code of dimension s consists of n servers storing lin...
research
08/29/2023

A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation

A code C {0,1}^k →{0,1}^n is a q-locally decodable code (q-LDC) if one c...

Please sign up or login with your details

Forgot password? Click here to reset