Malleable coding with edit-distance cost
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...
Main Authors: | Goyal, Vivek K., Varshney, Lav Raj, Kusuma, Julius |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers
2010
|
Online Access: | http://hdl.handle.net/1721.1/60357 |
Similar Items
-
On concentric spherical codes and permutation codes with multiple initial codewords
by: Nguyen, Ha Quy, et al.
Published: (2010) -
Concentric Permutation Source Codes
by: Nguyen, Ha Q., et al.
Published: (2012) -
Distributed scalar quantization for computing: High-resolution analysis and extensions
by: Misra, Vinith, et al.
Published: (2012) -
Channels that die
by: Goyal, Vivek K., et al.
Published: (2010) -
Frame permutation quantization
by: Nguyen, Ha Q., et al.
Published: (2012)