Random linear codes (RLCs) are well known to have nice combinatorial
pro...
The goal of the trace reconstruction problem is to recover a string
x∈{0...
This work continues the study of linear error correcting codes against
a...
The method of random Fourier features (RFF), proposed in a seminal paper...
Locally Decodable Codes (LDCs) are error-correcting codes
C:Σ^n→Σ^m with...
We study the classical expander codes, introduced by Sipser and Spielman...
Locally Decodable Codes (LDCs) are error-correcting codes for which
indi...
This paper studies linear and affine error-correcting codes for
correcti...
We study two fundamental problems in communication, Document Exchange (D...
We study approximation algorithms for the following three string measure...
We initiate a study of locally decodable codes with randomized encoding....
Document exchange and error correcting codes are two fundamental problem...
We study two basic problems regarding edit error, i.e. document exchange...
Synchronization strings are recently introduced by Haeupler and Shahrasb...