TY - GEN
T1 - Malleable coding with edit-distance cost
AU - Varshney, Lav R.
AU - Kusuma, Julius
AU - Goyal, Vivek K.
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/70449473944
U2 - 10.1109/ISIT.2009.5205494
DO - 10.1109/ISIT.2009.5205494
M3 - Conference contribution
AN - SCOPUS:70449473944
SN - 9781424443130
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 204
EP - 208
BT - 2009 IEEE International Symposium on Information Theory, ISIT 2009
T2 - 2009 IEEE International Symposium on Information Theory, ISIT 2009
Y2 - 28 June 2009 through 3 July 2009
ER -