Re: Semi-new Compression Method Fully Implemented
- From: "Einstein" <michaelhh@xxxxxxxxx>
- Date: 27 Apr 2006 07:28:25 -0700
Thank god, some real responses here :)
Ok, first this is just STAGE #1.... of a group of stages...
The effort here is to alter the probabilities of occurence in a binary
string.
Now that we have altered said values, what is the probabilities of a
string of all 0's, of all 1's and say 0000111100001111
Note use Pascals Triangle to derive the required numbers of each
occurrence , then work from there.
This is a CRITICAL step, so I have to make sure people understand this
step.... you might not yet see any value in this action, but trust me,
it EXISTS!
.
- Follow-Ups:
- Re: Semi-new Compression Method Fully Implemented
- From: markn@xxxxxxxx
- Re: Semi-new Compression Method Fully Implemented
- From: guenther vonKnakspott
- Re: Semi-new Compression Method Fully Implemented
- From: Earl Colby Pottinger
- Re: Semi-new Compression Method Fully Implemented
- References:
- Semi-new Compression Method Fully Implemented
- From: Tjackson.1982@xxxxxxxxx
- Re: Semi-new Compression Method Fully Implemented
- From: Tjackson.1982@xxxxxxxxx
- Re: Semi-new Compression Method Fully Implemented
- From: Earl Colby Pottinger
- Re: Semi-new Compression Method Fully Implemented
- From: Einstein
- Re: Semi-new Compression Method Fully Implemented
- From: sillybanter
- Semi-new Compression Method Fully Implemented
- Prev by Date: Re: New Compression Method
- Next by Date: Re: Please, PLEASE, hold your questions/comments/elsewhat til the end. Thank you. :)
- Previous by thread: Re: Semi-new Compression Method Fully Implemented
- Next by thread: Re: Semi-new Compression Method Fully Implemented
- Index(es):
Relevant Pages
|
|