Re: diehard and ent results quesion

From: Mok-Kong Shen (mok-kong.shen@t-online.de)
Date: 02/20/03 

From: Mok-Kong Shen <mok-kong.shen@t-online.de>
Date: Thu, 20 Feb 2003 21:50:27 +0100

Bryan Olson wrote:
>
> Cristiano wrote:
>
> > Your question is interesting, but I prefer a more direct one: is there a
> > computation for entropy (even extremely complicated) which is useful for
> > something?
>
> You mean given the samples, estimate the entropy of the source?
> No, there's no such computation.

Very dumb question: How should one understand
nonetheless the estimate of 1.3 bits/character of
normal English (see AC)? Thanks.

M. K. Shen

Relevant Pages

  • Re: diehard and ent results quesion
    ... >>reading that paper by Shannon would probably help. ... > giving an estimate of entropy of normal English. ... Bryan Olson pointed ...
    (sci.crypt)
  • Re: diehard and ent results quesion
    ... >> Bryan Olson wrote: ... estimate the entropy of the source? ... giving an estimate of entropy of normal English. ... So, if one accepts what AC cites, then there ...
    (sci.crypt)
  • Re: diehard and ent results quesion
    ... > Bryan Olson wrote: ... >>> What I'm trying to say is that the entropy given by ENT seems to ... Cristiano ...
    (sci.crypt)
  • Re: diehard and ent results quesion
    ... Bryan Olson wrote: ... >> Cristiano wrote: ... >>>What I'm trying to say is that the entropy given by ENT seems to me ...
    (sci.crypt)
  • Re: diehard and ent results quesion
    ... Cristiano wrote: ... > Bryan Olson wrote: ... > computation for entropy which is useful for ... > useless because almost all generators seem to have 8 bpb (if you test ...
    (sci.crypt)
Loading