-
force closing without extraction.
-
- ~tune relative importance of criteria~
- better piece-square tables
- arithmetic coding (https://www.reddit.com/r/chess/comments/83xmhl/lichess_developer_update_275_improved_game/dvlsijp/) or grou…
-
In #189 we are investigating how MGARD performs on some very noisy data. When this data is compressed with a tight error tolerance and then decompressed, we get an error in [`huffman_decoding`][huffma…
-
Hey guys, Huffman encoding isn't going to work with floating point values that can essentially be infinite. The idea of Huffman encoding is to take a finite domain of values and create a binary tree …
-
Hello,
Thanks for providing the powerful **craft.c** and **print_tree.c**. Here I developed a tool to discover a set of bad code_lengths by modifying zlib's **enough.c**. I call it NotEnough. For 4…
-
### Subject of the issue
In an attempt to produce a cram_filter tool to drop specific columns, I seem to have hit an issue in the htsjdk decoding which I am unsure about.
Specifically when I drop th…
-
Hello Niklas,
I'd love to have to a method to create a book/tree from an existing Huffman code. This is useful for decoding files, where the Huffman table is saved in the file.
Are you open for s…
-
0xFF bytes in Huffman data need special coding that adds another byte of overhead. If this overhead could be reliably minimized, then approximation of size if scan data described #15 would be more eff…
-
There is no function that would allow convert Huffman tree to stream and save it somewhere.
For example if I would save the code (vector) stream to file, and later on I would need to decode it. I co…
-
We are currently implementing Huffman decoding by looping over a table with a list of encoded values for each length. (See Huffman.cs)
This doesn't seem particularly efficient.
Instead, we shou…