Malleable coding with edit-distance cost
Author(s)Goyal, Vivek K.; Varshney, Lav Raj; Kusuma, Julius
MetadataShow full item record
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.
DepartmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
IEEE International Symposium on Information Theory, 2009. ISIT 2009
Institute of Electrical and Electronics Engineers
Varshney, L.R., J. Kusuma, and V.K. Goyal. “Malleable coding with edit-distance cost.” Information Theory, 2009. ISIT 2009. IEEE International Symposium on. 2009. 204-208.© 2009 IEEE.
Final published version
INSPEC Accession Number: 10841922