Corpus ID: 3827640

Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets

@article{Cheng2017SynchronizationSE,
  title={Synchronization Strings: Efficient and Fast Deterministic Constructions over Small Alphabets},
  author={Kuan Cheng and X. Li and Ke Wu},
  journal={ArXiv},
  year={2017},
  volume={abs/1803.03530}
}
Synchronization strings are recently introduced by Haeupler and Shahrasbi (STOC 2017) in the study of codes for correcting insertion and deletion errors (insdel codes). They showed that for any parameter $\varepsilon>0$, synchronization strings of arbitrary length exist over an alphabet whose size depends only on $\varepsilon$. Specifically, they obtained an alphabet size of $O(\varepsilon^{-4})$, which left an open question on where the minimal size of such alphabets lies between $\Omega… Expand
Synchronization strings: explicit constructions, local decoding, and applications
Efficient Linear and Affine Codes for Correcting Insertions/Deletions
2-Deletion Codes: Beyond Binary
Near-linear time insertion-deletion codes and (1+ε)-approximating edit distance via indexing
Deterministic Document Exchange Protocols, and Almost Optimal Binary Codes for Edit Errors
  • Kuan Cheng, Zhengzhong Jin, Xin Li, Ke Wu
  • Mathematics, Computer Science
  • 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2018
Locally Decodable Codes with Randomized Encoding
On the List Decodability of Insertions and Deletions
...
1
2
...

References

SHOWING 1-10 OF 36 REFERENCES
Synchronization Strings: List Decoding for Insertions and Deletions
Synchronization strings: explicit constructions, local decoding, and applications
Synchronization strings: codes for insertions and deletions approaching the Singleton bound
Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
An Improved Bound on the Fraction of Correctable Deletions
Coding for Interactive Communication Correcting Insertions and Deletions
Linear-time encodable/decodable codes with near-optimal rate
Interactive Channel Capacity Revisited
  • Bernhard Haeupler
  • Computer Science, Mathematics
  • 2014 IEEE 55th Annual Symposium on Foundations of Computer Science
  • 2014
New Constructive Aspects of the Lovasz Local Lemma
Deterministic algorithms for the Lovász Local Lemma
...
1
2
3
4
...