Re: Compression test on permutations
- From: Phil Carmody <thefatphil_demunged@xxxxxxxxxxx>
- Date: 24 Apr 2007 02:06:17 +0300
erpy <info@xxxxxxxxxxxxxxxx> writes:
Josiah Carlson ha scritto:
erpy wrote:
So, basically you have 256 permutations of size 256-bytes each, one
after the other.
Generally, the "RAD" files that were being proposed were exactly
this, and you can generally reduce the size by around 25%-32%
(assuming a sufficiently precise arithmetic coder).
Apologies, the whole thread just disappeared from my server.
Would you please explain again how an arith coder would take off
25%-32% of the chars ?
I make it <18%
? log(256!)/log(256)
210.4995359030268274257684599
? %/256
0.8222638121211985446319080465
Phil
--
"Home taping is killing big business profits. We left this side blank
so you can help." -- Dead Kennedys, written upon the B-side of tapes of
/In God We Trust, Inc./.
.
- References:
- Compression test on permutations
- From: erpy
- Re: Compression test on permutations
- From: Josiah Carlson
- Re: Compression test on permutations
- From: erpy
- Compression test on permutations
- Prev by Date: Re: Compression test on permutations
- Next by Date: BWC by Willem Monsuwe - compression question
- Previous by thread: Re: Compression test on permutations
- Next by thread: Re: Compression test on permutations
- Index(es):
Relevant Pages
|
|