Computer Science – Information Theory
Scientific paper
2011-02-17
Computer Science
Information Theory
9 pages, 2 figures. A shorter version will appear in IEEE International Symposium on Information Theory (ISIT), 2011
Scientific paper
The problem of reconstructing a source sequence with the presence of decoder side-information that is mis-synchronized to the source due to deletions is studied in a distributed source coding framework. Motivated by practical applications, the deletion process is assumed to be bursty and is modeled by a Markov chain. The minimum rate needed to reconstruct the source sequence with high probability is characterized in terms of an information theoretic expression, which is interpreted as the amount of information of the deleted content and the locations of deletions, subtracting "nature's secret", that is, the uncertainty of the locations given the source and side-information. For small bursty deletion probability, the asymptotic expansion of the minimum rate is computed.
Ma N. N.
Ramchandran Kannan
Tse David
No associations
LandOfFree
Efficient File Synchronization: a Distributed Source Coding Approach 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 Efficient File Synchronization: a Distributed Source Coding Approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Efficient File Synchronization: a Distributed Source Coding Approach will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-381088