> Den tisdagen den 22:e juli 2014 kl. 17:51:48 UTC+2 skrev Ben Bacarisse: >> email@example.com writes: >> > Den tisdagen den 22:e juli 2014 kl. 16:20:37 UTC+2 skrev Ben Bacarisse: >> >> firstname.lastname@example.org writes: <snip> >> >> > It will a binary sequense of any length by a third. >> >> >> >> What lengths will the sequences "", "0", "1", "00", "01", "10" and "11 >> >> become? >> > >> > I do not think anyone but a fool is interested in compressing binary >> > digit pairs. Are you a fool? >> >> Yes, I am, but my point still stands. All you need to do is re-phrase >> "binary sequence of any length" so that it becomes true for your >> proposed algorithm. (I can't help with that because I don't know the >> algorithm). > > Oh you want me to rephrase binary sequense and use the lower bound for > 1/3 compressoin. I do not know probably around 12-20 bit.
Yes, that was my point. So, roughly speaking, all 30-bit strings compress to 20-bit strings?
You know, presumably that there are more than 1000 times more 30-bit strings than there are 20-bit ones?