The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Arithmetic compression
Replies: 1   Last Post: Jul 22, 2014 12:15 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View  
Ben Bacarisse

Posts: 1,972
Registered: 7/4/07
Re: Arithmetic compression
Posted: Jul 22, 2014 12:15 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply writes:

> Den tisdagen den 22:e juli 2014 kl. 17:51:48 UTC+2 skrev Ben Bacarisse:
>> writes:
>> > Den tisdagen den 22:e juli 2014 kl. 16:20:37 UTC+2 skrev Ben Bacarisse:
>> >> writes:
>> >> > 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?


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.