Re: What´s the algorithm that compresses a 20 digit big int, into 8 bytes ?
From: Rafael Anschau <rafael.anschau_at_gmail.com>
Date: Fri, 16 Apr 2010 13:11:20 -0700 (PDT)
Message-ID: <1eee0be7-3f04-4c98-92b3-a4ea07e1d948_at_x42g2000vba.googlegroups.com>
Date: Fri, 16 Apr 2010 13:11:20 -0700 (PDT)
Message-ID: <1eee0be7-3f04-4c98-92b3-a4ea07e1d948_at_x42g2000vba.googlegroups.com>
On Apr 16, 4:43 pm, Doug <Doug.McMa..._at_oracle.com> wrote:
> No possible compression could work if you have N possible input
> values, but only M possible output values, with M < N. This is
> obvious just by thinking about reversing the compression: with at most
> M distinct values in the compressed space, you can have at most M
> uncompressed values, meaning that some values from the original N
> can't be represented.
True. Thanks Doug. I guess passion was above reason when I wrote that.
Rafael Received on Fri Apr 16 2010 - 22:11:20 CEST