DocumentCode :
3511981
Title :
Malleable coding with fixed segment reuse
Author :
Kusuma, Julius ; Varshney, Lav R. ; Goyal, Vivek K.
Author_Institution :
Res. Lab. of Electron., Massachusetts Inst. of Technol., Cambridge, MA, USA
fYear :
2011
fDate :
July 31 2011-Aug. 5 2011
Firstpage :
568
Lastpage :
572
Abstract :
In cloud computing, storage area networks, and remote backup storage, stored data is modified with updates from new versions. It is desirable for the data to not only be compressed but to also be easily modified during updates, since representing information and modifying the representation are both expensive. A malleable coding scheme considers both compression efficiency and ease of alteration, promoting codeword reuse. We examine the trade-off between compression efficiency and malleability cost-the difficulty of synchronizing compressed versions-measured as the length of a reused prefix portion. Through a coding theorem, the region of achievable rates and malleability is expressed as a single-letter optimization. Relationships to common information problems are also described.
Keywords :
data compression; encoding; optimisation; cloud computing; coding theorem; fixed segment reuse; malleable coding scheme; remote backup storage; single-letter optimization; storage area networks; Channel coding; Decoding; Entropy; Markov processes; Random variables; Source coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
ISSN :
2157-8095
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2011.6034192
Filename :
6034192
Link To Document :
بازگشت