Malleable coding with edit-distance cost

Author(s)
Goyal, Vivek K.; Varshney, Lav Raj; Kusuma, Julius
Thumbnail
DownloadGoyal_Malleable coding.pdf (640.8Kb)
PUBLISHER_POLICY
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.
Metadata
Show full item record
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.
Date issued
2009-08
URI
http://hdl.handle.net/1721.1/60357
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
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
Other identifiers
INSPEC Accession Number: 10841922
ISBN
978-1-4244-4312-3
Collections