let C be a Prefix Code d1...dn length of each word
- From: mastere1981@xxxxxxxxx
- Date: 16 Nov 2005 09:05:30 -0800
I need to show that
2^(-d1)+...+2^-(-dn)<=1
Tried to do it in induction but it didn't work. Is that the way to do
it?
.
- Follow-Ups:
- Re: let C be a Prefix Code d1...dn length of each word
- From: Jackson
- Re: let C be a Prefix Code d1...dn length of each word
- From: Willem
- Re: let C be a Prefix Code d1...dn length of each word
- Prev by Date: Re: WATCH OUT!!! It's SPAM !!! the $ 10 000 PRIZE THE NEW CONJECTURE -
- Next by Date: Re: How many compression/decompression variants are there?
- Previous by thread: the $ 10 000 PRIZE THE NEW CONJECTURE
- Next by thread: Re: let C be a Prefix Code d1...dn length of each word
- Index(es):
