At 4:58 PM -0400 5/3/04, David Mertz wrote:
> >Let n be the highest number being encoded [DQM: "Vote Space"]
>>Let d be the number of bits in a digit
> >Let b be the base (2**n)
My typo. b=2**d, not n. Sorry.
> >Let m be one-half of the base
>>The number of digits, g = floor (log_m(n) +1)
> >The number of bits is d*g
Best regards,
Arthur
-- ------------------------------------------------------------------------------- Arthur M. Keller, Ph.D., 3881 Corina Way, Palo Alto, CA 94303-4507 tel +1(650)424-0202, fax +1(650)424-0424 ================================================================== = The content of this message, with the exception of any external = quotations under fair use, are released to the Public Domain ==================================================================Received on Mon May 31 23:17:05 2004
This archive was generated by hypermail 2.1.8 : Mon May 31 2004 - 23:18:15 CDT