126

Re: Dispersion of length of archive?

exp98 wrote:

it is passed...
And nobody remembers "final verdicts" French Ak. ?
Stones cannot fall from the sky, for it not  the earth.
Devices more heavily air cannot fly.

I do not know, why this example always result.
It was at the time of when the chemistry was still alchemy, and the science was related to present pseudo-sciences. As a matter of fact, there was one title, the science as that was not.

127

Re: Dispersion of length of archive?

softwarer wrote:

it is passed...
Well naive they and improvident. It is necessary so: "the perpetuum mobile Project will be considered after its operating prototype within two hundred years smoothly supplies with an electricity the Academy building".

+1
Similarly, let someone (we will not point a finger, but is Ivan FXS), at first shows an operating prototype of the archiver on the basis of , and then we will already argue on it.

128

Re: Dispersion of length of archive?

FXS wrote:

is more exact, it is not true: compression follows the account of that records they have shorter identifier, than.

Optionally. I remember the first implementation " Haffmana" (then, in the late eighties, we still knew nothing about Haffmane, on frequency of occurrence of characters in the text, an oblique binary tree) - the identifier of the most often met character occupied 1 bit, most rarely met could occupy much more than 8 bits. The compression level, of course, was not so, but the purposes were slightly others (to cipher text reference system and to have time to display on the screen from archive that at  the user did not note brakes).

129

Re: Dispersion of length of archive?

LR wrote:

the identifier of the most often met character occupied 1 bit, most rarely met could occupy much more than 8 bits. The compression level, of course, was not so, but the purposes were slightly others (to cipher

I I will not cling at all to "the purposes were slightly others (to cipher"
Business volume that if to leave some substrings "not encoded" (not to replace with their identifiers) it will be necessary to spend resources (bits) for marking of these parts of an output flow as "the crude data" (which take as is, do not try to decode). Therefore it is possible to present a situation when some ("last of Mohicans") appear to be encoded substrings of an input flow more favourably even longer, than they, identifiers.

130

Re: Dispersion of length of archive?

By the way

LR wrote:

the identifier of the most often met character occupied 1 bit

- and how many the bit was occupied with the "marking", allowing to identify this identifier as the identifier?

131

Re: Dispersion of length of archive?

S.G. wrote:

it is similar, let someone (we will not point a finger, but it is Ivan FXS), at first shows an operating prototype of the archiver on the basis of , and then we will already argue on it.

explain, - if to assume that I  "an operating prototype of the archiver on the basis of ", - what for would be required to me here it here - "at first shows..., and then we will already argue on it"?
I consider a subject, on which I do not have clear understanding to receive it - clearer - understanding. If it is not interesting to you, means... It is not interesting to you, that's all. It, apparently, are free a forum of the free people.
(Excuse, if it turned out sharply.)

132

Re: Dispersion of length of archive?

FXS wrote:

by the way
it is passed...
-- And how many the bit was occupied with the "marking", allowing to identify this identifier as the identifier?

In archive received "the oblique tree" (dictionary), then - __ sequence of encoded contents at first registered. "Tree" on which "leaves" characters hang in the beginning was derived from archive, and, then subsequent __ the sequence of bits behind bit specified where to go on a tree (0/1 = on the left/to the right), to "leaves" - a leaf behind a leaf. Here also solve how many bit "marking" occupies here...

133

Re: Dispersion of length of archive?

Ivan FXS;
Here here in  all explicitly is painted and even animated  is))

134

Re: Dispersion of length of archive?

LR, that is any part Z of an input line remains encoded (in an output line S)? Then yes, in "__ sequence of encoded contents" it is possible to do without a marking.
If some substring Z in an input line S met exactly once (is unique), you need 1) to allocate it in the dictionary; 2) somehow to "coordinate" it there to its code (it is possible, it turns out compactly enough); 3) to deliver its code (in "__ sequence of encoded contents") on a place specifying position Z in S. That is it is is specific this substring Z "plays" rather against compression...

135

Re: Dispersion of length of archive?

Read "any part Z of an input line S remains encoded (in an output line S')"

136

Re: Dispersion of length of archive?

Ivan FXS;
Yes, all is encoded

137

Re: Dispersion of length of archive?

FXS wrote:

substring Z "plays" rather against compression

... At all without mentioning that its code can appear more long her

138

Re: Dispersion of length of archive?

FXS wrote:

If some substring Z in an input line S met exactly once (is unique), you need 1) to allocate it in the dictionary; 2) somehow to "coordinate" it there to its code (it is possible, it turns out compactly enough); 3) to deliver its code (in "__ sequence of encoded contents") on a place specifying position Z in S. That is it is is specific this substring Z "plays" rather against compression...

Layout Z in an archive body too is not free: it will be necessary to provide any identifier that further value of a line, instead of its identifier from the dictionary. Still it is necessary to set somehow the size of a line.
Therefore the question disputable as as a result will be more compact.

139

Re: Dispersion of length of archive?

Dima T, like I also wrote it at 13:33:

FXS wrote:

Business the volume that if to leave some substrings "not encoded" (not to replace with their identifiers) it will be necessary to spend resources (bits) for marking of these parts of an output flow as "the crude data" (which take as is, do not try to decode).

140

Re: Dispersion of length of archive?

FXS wrote:

Present that in our input flow in the end the end found out two entrances lines in length of 1000 bits...

I generally would not began to consider repetitions, considering  since in the presence of repetition it is possible to replace shorter substring with the link to longer, i.e.  it turns out at all at anything.

141

Re: Dispersion of length of archive?

Did not understand that such

Dima T wrote:

shorter substring... Longer

in case of repetition?
Well and substrings "0" and "1" (or, say, "00", "01", "10" and "11") repeat to... Repeatedly. Only on what them to replace?

142

Re: Dispersion of length of archive?

FXS wrote:

did not understand that such it is passed...
In case of repetition?
Well and substrings "0" and "1" (or, say, "00", "01", "10" and "11") repeat to... Repeatedly. Only on what them to replace?

the answer to this question is obvious. If to change there is nothing not to change.

143

Re: Dispersion of length of archive?

FXS wrote:

mayton;
Generally speaking, if we on a Centaur Alpha send the file compressed by the archiver, and we want that local  it unpacked, we should together with a file of archive and (de-) the archiver to send, and... An operating system, and it is a lot of that else, even I will not undertake to enumerate.

What for an operating system?

144

Re: Dispersion of length of archive?

Type, (de-) the archiver so , as on   fulfills?

145

Re: Dispersion of length of archive?

FXS wrote:

type, (de-) the archiver so , as on   fulfills?

It is possible to think that the operating system rises on  to gland.
It even if (suddenly) is a method to embody a transmitted signal in the storage systems accepted on a Centaur.
P.S. And in vain you do not want to think of physical limits and restrictions.

146

Re: Dispersion of length of archive?

FXS wrote:

it is passed...
Explain, - if to assume that I  "an operating prototype of the archiver on the basis of ", - what for would be required to me here it here - "at first shows..., and then we will already argue on it"?
I consider a subject, on which I do not have clear understanding to receive it - clearer - understanding. If it is not interesting to you, means... It is not interesting to you, that's all. It, apparently, are free a forum of the free people.
(Excuse, if it turned out sharply.)

Because to create thus the archiver - it is impossible.
Therefore it is useful to try not only "on fingers", but also to create a prototype, and to look as it will work. , for example, any hash smile