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

11/01/2021
by   Jeremiah Blocki, et al.
0

Locally Decodable Codes (LDCs) are error-correcting codes for which individual message symbols can be quickly recovered despite errors in the codeword. LDCs for Hamming errors have been studied extensively in the past few decades, where a major goal is to understand the amount of redundancy that is necessary and sufficient to decode from large amounts of error, with small query complexity. In this work, we study LDCs for insertion and deletion errors, called Insdel LDCs. Their study was initiated by Ostrovsky and Paskin-Cherniavsky (Information Theoretic Security, 2015), who gave a reduction from Hamming LDCs to Insdel LDCs with a small blowup in the code parameters. On the other hand, the only known lower bounds for Insdel LDCs come from those for Hamming LDCs, thus there is no separation between them. Here we prove new, strong lower bounds for the existence of Insdel LDCs. In particular, we show that 2-query linear Insdel LDCs do not exist, and give an exponential lower bound for the length of all q-query Insdel LDCs with constant q. For q ≥ 3 our bounds are exponential in the existing lower bounds for Hamming LDCs. Furthermore, our exponential lower bounds continue to hold for adaptive decoders, and even in private-key settings where the encoder and decoder share secret randomness. This exhibits a strict separation between Hamming LDCs and Insdel LDCs. Our strong lower bounds also hold for the related notion of Insdel LCCs (except in the private-key setting), due to an analogue to the Insdel notions of a reduction from Hamming LCCs to LDCs. Our techniques are based on a delicate design and analysis of hard distributions of insertion and deletion errors, which depart significantly from typical techniques used in analyzing Hamming LDCs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/19/2022

On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors

Locally Decodable Codes (LDCs) are error-correcting codes C:Σ^n→Σ^m with...
research
03/25/2021

Private and Resource-Bounded Locally Decodable Codes for Insertions and Deletions

We construct locally decodable codes (LDCs) to correct insertion-deletio...
research
10/22/2020

Locally Decodable/Correctable Codes for Insertions and Deletions

Recent efforts in coding theory have focused on building codes for inser...
research
09/15/2020

Relaxed Locally Correctable Codes with Improved Parameters

Locally decodable codes (LDCs) are error-correcting codes C : Σ^k →Σ^n t...
research
11/25/2019

Combinatorial lower bounds for 3-query LDCs

A code is called a q-query locally decodable code (LDC) if there is a ra...
research
07/02/2020

Efficient Document Exchange and Error Correcting Codes with Asymmetric Information

We study two fundamental problems in communication, Document Exchange (D...
research
04/11/2018

Maximizing Hamming Distance in Contraction of Permutation Arrays

A permutation array A is set of permutations on a finite set Ω, say of ...

Please sign up or login with your details

Forgot password? Click here to reset