Combinatorial lower bounds for 3-query LDCs

11/25/2019
by   Arnab Bhattacharyya, et al.
0

A code is called a q-query locally decodable code (LDC) if there is a randomized decoding algorithm that, given an index i and a received word w close to an encoding of a message x, outputs x_i by querying only at most q coordinates of w. Understanding the tradeoffs between the dimension, length and query complexity of LDCs is a fascinating and unresolved research challenge. In particular, for 3-query binary LDCs of dimension k and length n, the best known bounds are: 2^k^o(1)≥ n ≥Ω̃(k^2). In this work, we take a second look at binary 3-query LDCs. We investigate a class of 3-uniform hypergraphs that are equivalent to strong binary 3-query LDCs. We prove an upper bound on the number of edges in these hypergraphs, reproducing the known lower bound of Ω̃(k^2) for the length of strong 3-query LDCs. In contrast to previous work, our techniques are purely combinatorial and do not rely on a direct reduction to 2-query LDCs, opening up a potentially different approach to analyzing 3-query LDCs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2023

Randomized and quantum query complexities of finding a king in a tournament

A tournament is a complete directed graph. It is well known that every t...
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...
research
09/15/2020

Relaxed Locally Correctable Codes with Improved Parameters

Locally decodable codes (LDCs) are error-correcting codes C : Σ^k →Σ^n t...
research
12/08/2017

Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location

We re-examine parameters for the two main space decomposition technique...
research
11/01/2021

Exponential Lower Bounds for Locally Decodable and Correctable Codes for Insertions and Deletions

Locally Decodable Codes (LDCs) are error-correcting codes for which indi...
research
04/25/2023

Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games

In the first-order query model for zero-sum K× K matrix games, playersob...
research
02/15/2022

Second Best, Third Worst, Fourth in Line

We investigate decomposable combinatorial labeled structures more fully,...

Please sign up or login with your details

Forgot password? Click here to reset