Malleable coding with edit-distance cost

Authors:
Lav R. Varshney;Julius Kusuma;Vivek K. Goyal
Affiliations:
Research Laboratory of Electronics and Laboratory for Information and Decision Systems, MIT;Schlumberger Technology Corporation;Research Laboratory of Electronics
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Year:
2009

Citing 6
Cited 0

A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
In-Place Reconstruction of Version Differences

IEEE Transactions on Knowledge and Data Engineering
Improving duplicate elimination in storage systems

ACM Transactions on Storage (TOS)
Identification entropy

General Theory of Information Transfer and Combinatorics
Information distance

IEEE Transactions on Information Theory
On the optimality of the binary reflected Gray code

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

A malleable coding scheme considers not only representation length but also ease of representation update, thereby encouraging some form of recycling to convert an old codeword into a new one. We examine the trade-off between compression efficiency and malleability cost, measured with a string edit distance that introduces a metric topology to the representation domain. We characterize the achievable rates and malleability as the solution of a subgraph isomorphism problem.