Invalid data for huffman table in lines
136: { 1,1,1,1,1,1,0 }, // -> should be 'X' { 1,1,1,1,1,1,0,0 }
137: { 1,1,1,0,0,1,1 }, //OK
138: { 1,1,1,1,1,1,0 }, // -> should be 'Z' { 1,1,1,1,1…
I think we can improve the processing speed by a lot by using the joblib package: https://joblib.readthedocs.io/en/latest/parallel.html
As we know, huffman decoding is hard to parallelise but we ca…
I'm very interested in compression.Huffman coding can be performed sequentially,I can't understand why huffman code is executed in reverse order in the code.
The x86-64 Huffman assembly implementation is currently allow-listed to work on:
* Linux: `defined(__linux__) || defined(__linux)`
* MacOS: `defined(__APPLE__)`
The macro to check this is `HUF_AS…
Currently we are using a direct encoding when we encode headers. We can optimize by using Huffman code: https://tools.ietf.org/html/rfc7541#section-2.4.
Related work:
- Static compression #2950
…
in `d2common/d2data/d2compression/huffman.go`:
For compression type 0, `AdjustTree` should be called once for every value written, and only once (in `insertNode`).
It's currently called twice (b…
@richgel999
Could you please confirm the following maximum sizes for Basis Huffman tables? We need that for a memory-constrained decoder implementation.
- Initial length codes of each table: up t…
Change the regroup of Bytes in the decompression method -> implement it in Python. -> Change the current Python implementation to c and bind it to Python