Malleable coding with edit-distance cost
Name
Goyal_Malleable coding.pdf
Size
640.9 KB
Format
Adobe PDF
Checksum (MD5)
9c28f92f050141961bf7e096989ecc53
Author(s)
Goyal, Vivek K.
Varshney, Lav Raj
Kusuma, Julius
Date Issued
August 2009
Journal
IEEE International Symposium on Information Theory, 2009. ISIT 2009
Publisher
Institute of Electrical and Electronics Engineers
Citation
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.
Version
Final published version
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2009.5205494
