Published June 2015
| public
Book Section - Chapter
Reconciling similar sets of data
Abstract
In this work, we consider the problem of synchronizing two sets of data where the size of the symmetric difference between the sets is small and, in addition, the elements in the symmetric difference are related. In this introductory work, the elements within the symmetric difference are related through the Hamming distance metric. Upper and lower bounds are derived on the minimum amount of information exchange. Furthermore, explicit encoding and decoding algorithms are provided for special cases.
Additional Information
© 2015 IEEE. Date Added to IEEE Xplore: 01 October 2015. This work was funded by the NISE program at SSC Pacific.Additional details
- Eprint ID
- 72312
- DOI
- 10.1109/ISIT.2015.7282974
- Resolver ID
- CaltechAUTHORS:20161128-111814266
- Space and Naval Warfare Systems Center Pacific
- Created
-
2016-11-28Created from EPrint's datestamp field
- Updated
-
2021-11-11Created from EPrint's last_modified field