Malleable coding with fixed segment reuse

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 costthe difficulty of synchronizing compressed versionsmeasured 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.

Original languageEnglish (US)
Title of host publication2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Pages568-572
Number of pages5
DOIs
StatePublished - 2011
Externally publishedYes
Event2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011 - St. Petersburg, Russian Federation
Duration: Jul 31 2011Aug 5 2011

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8104

Other

Other2011 IEEE International Symposium on Information Theory Proceedings, ISIT 2011
Country/TerritoryRussian Federation
CitySt. Petersburg
Period7/31/118/5/11

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Malleable coding with fixed segment reuse'. Together they form a unique fingerprint.

Cite this