Description:
Data compression algorithms and theory.
|
|
|
Ann: Zip-Ada v.42
|
| |
Hello!
I am pleased to announce a new version of the Zip-Ada library, @
[link] .
Major changes in the last versions:
42: Support for Zip archives appended to other files, like a self-
extracting archive with Zip-Ada in the executable
41: Support for Unicode (UTF-8) entry names within Zip archives... more »
|
|
|
I'm looking for a program that will go through a number of files...
|
| |
Fully decompressed, I have (this is an estimate only!,) about 20-30 TB
of files, some, .gz, some .bz2, some .tar. some .arj, you get the
idea. I think the largest file is, say, around 250GB.
And these files are, in some cases, duplicates of others. Or almost
duplicates, but for a few diff's.... more »
|
|
|
Stupid old brain question, how to measure a hash function's quality
|
| |
Okay, after a long time I am starting my work on a compressing VIRTUAL-
RAM-DRIVE again.
The main reason is to test BFS ability to handle large hard drives and
large files (ie. Drives/Files 4TB and larger).
The non-compressing version I presently am using uses a sparse model
that only needs memory when a data_track has data written into it.... more »
|
|
|
Predicting the size of a Huffman block?
|
| |
That's pretty much it: Given the number of occuring symbols and the
length of the file or data to be compressed, how do I estimate the
size of the output? I have to do this quickly on 8-bit, 16-bit and 32-
bit computers. I can work on predicting the size of the overhead
myself.
-------------------... more »
|
|
|
Factoring
|
| |
For some reason Google Groups stopped sending me daily digests from
comp.compression. The fact that it took me a month to notice is
interesting all in itself.
Ernst is working on trying to factor the million digit number.
As I've mentioned before, if the million digit number just happened to... more »
|
|
|
