Malleable Coding with Fixed Reuse

Details Malleable Coding with Fixed Reuse Malleable Coding with Fixed Reuse

2008-09-04

arxiv.org/abs/0809.0737v2

Computer Science

Information Theory

Scientific paper

In cloud computing, storage area networks, remote backup storage, and similar settings, stored data is modified with updates from new versions. Representing information and modifying the representation are both expensive. Therefore it is desirable for the data to not only be compressed but to also be easily modified during updates. 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.

Affiliated with

Also associated with

No associations

Rating

Malleable Coding with Fixed Reuse does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Malleable Coding with Fixed Reuse, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Malleable Coding with Fixed Reuse will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141416