## Abstract

We consider the problem of reconciling two remote strings of arbitrary and unknown similarity using minimum communication, which is at the core of some important problems in networking, cryptography, genetic engineering, and even linguistics. Though this problem is efficiently convertible into a set reconciliation instance, for which efficient solutions exist, this conversion may introduce ambiguity in the decoding process, which may require significant communication and computational resources to resolve. We leverage some recent advances in efficient unique decodability of strings to reduce decoding ambiguity, and thus pave the way for a practical implementation of this string reconciler. For certain random strings and in some ideal cases, our approach reconciles two length n strings that differ in α edits (with α not known a priori) using O (α log ^{2}(n)) communication.

Original language | English |
---|---|

Title of host publication | 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012 |

Pages | 2751-2755 |

Number of pages | 5 |

DOIs | |

State | Published - 22 Oct 2012 |

Event | 2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: 1 Jul 2012 → 6 Jul 2012 |

### Conference

Conference | 2012 IEEE International Symposium on Information Theory, ISIT 2012 |
---|---|

Country/Territory | United States |

City | Cambridge, MA |

Period | 1/07/12 → 6/07/12 |

## ASJC Scopus subject areas

- Theoretical Computer Science
- Information Systems
- Modeling and Simulation
- Applied Mathematics