Malleable coding with edit-distance cost

Lav R. Varshney, Julius Kusuma, Vivek K. Goyal
2009 2009 IEEE International Symposium on Information Theory  
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.
doi:10.1109/isit.2009.5205494 dblp:conf/isit/VarshneyKG09 fatcat:kjhrb4x4czewhn34bg3tltfqvq