ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let an input bit vector be transformed by the special invertible encoding matrix RR described above, whose entries satisfy

rlm=1when m=l or m=l+1,r_{lm}=1 \quad\text{when } m=l \text{ or } m=l+1,

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 3020430204 and 6140861408 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.