Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors
Deterministic Document Exchange Protocols and Almost Optimal Binary Codes for Edit Errors
We study two basic problems regarding edit errors, document exchange and error correcting codes. Here, two parties try to exchange two strings with length roughly n and edit distance at most k , or one party tries to send a string of length n to another party through a channel …