Computer Science – Information Theory
Scientific paper
2011-07-14
Computer Science
Information Theory
14 pages, submitted to the Journal of Statistical Mechanics: Theory and Experiment
Scientific paper
We propose a rigorous analysis approach for the subset sum problem in the context of lossless data compression, where the phase transition of the subset sum problem is directly related to the passage between ambiguous and non-ambiguous decompression, for a compression scheme that is based on specifying the sequence composition. The proposed analysis lends itself to straightforward extensions in several directions of interest, including non-binary alphabets, incorporation of side information at the decoder (Slepian-Wolf coding), and coding schemes based on multiple subset sums. It is also demonstrated that the proposed technique can be used to analyze the critical behavior in a more involved situation where the sequence composition is not specified by the encoder.
No associations
LandOfFree
Subset sum phase transitions and data compression 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 Subset sum phase transitions and data compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subset sum phase transitions and data compression will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-224904