2000 character limit reached
Bounding Lossy Compression using Lossless Codes at Reduced Precision (1301.0026v1)
Published 31 Dec 2012 in cs.MM, cs.IT, and math.IT
Abstract: An alternative approach to two-part 'critical compression' is presented. Whereas previous results were based on summing a lossless code at reduced precision with a lossy-compressed error or noise term, the present approach uses a similar lossless code at reduced precision to establish absolute bounds which constrain an arbitrary lossy data compression algorithm applied to the original data.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.