The less-than-one-bit space-saving conjecture for the invertible transformation
Statement
Let an input bit vector be transformed by the special invertible encoding matrix described above, whose entries satisfy
and are zero otherwise. The transformation maps the input to an output representation, and space saving means the difference between the numbers of bits needed to represent the input and output.
Space-saving conjecture. The space saving using this transformation is on average less than one bit, even when applied to high-entropy input.
This claim is presented as a conjecture motivated by simulations for input lengths and and varying proportions of zeros and ones; the supplied text gives no proof or resolution.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.