hexxagone
hexxagone on Hacker News
People like to blame the bureaucrats in Brussels for everything. They have nothing to do with the decision of the Danish government.
In the LZ high compression regime where LZ can compete in terms of ratio, BWT compressors are faster to compress and slower to decompress than LZ codecs. BWT compressors are also more amenable to parallelization (check bsc and kanzi for modern implementations besides bzip3).
Notice that bzip3 has close to nothing to do with bzip2. It is a different BWT implementation with a different entropy codec, from a different author (as noted in the GitHub description "better and stronger spiritual successor to BZip2").
There are experts working at the commission.
Posted by
hexxagone on Thursday May 30, 2024 @01:52PM
from the show-hn dept.
https://github.com/flanglet/kanzi-cpp
Give it a try. Let me know what you think.
Is BFMTV also biased when reporting words directly from the mouth of Piotr Tolstoi or are you just trolling ?
It is not. Just look at the frequencies in the data (histogram) and compute the order 0 entropy. Then you know if your data is compressible.
Go does not have threads but something like "tasks". The fact that no thread handle is exposed allows for transparently moving these tasks across threads if the scheduler decides so.
"go makes concurrency a first-class concept"
I think it usually refers to goroutines being built in the language.
"Go is abnormally dangerous when it comes to concurrency IMO". Personnally, it has not been my experience with Go concurrency. However I have hit some issues when trying to ocrhestrate tasks via channels and ended up resorting to atomics to do the job.
"Ukraine did not behave reasonably"
UH ?
"Turns out a good arith coder is much faster". Citation needed.
In data compression, inverting a BWT with large blocks or using Context Mixing to compress large blocks (which requires huge context maps). These 2 cases require a lot of random memory accesses.
I am sure the Scotts and Irish are thrilled by the change.
Arguably the EU is enforcing the rights of their citizens more than in many other places (eg. GDPR). Ultimately the EU citizens should vote when there are parliament elections instead of complaining about the bureaucrats afterwards. Only 50% turnout last time.
If you knew anything about the EU institutions, you would know that the Commission's role is only to enforce rules that member states have agreed upon but it has _no_ power.
Of course facts do not fit with the Brexiters' rhetoric.
No mention of Louis Pasteur ? Odd.
Isn't it how free markets work ?
The Huffman encoding loop is 2 lines and decoding loop is 4 lines of branchless code.
Do you have an example of branchless arithmetic encoder or decoder ?
pigz is no match for zstd...
"Arithmetic coding is much, much simpler." Let us agree to disagree.
"And decompression speed is not a limiting factor in most applications of data compression like this". It depends on the application. Zstd and Brotli are certainly aiming at the fastest decompression speed possible.
"FSE achieves markedly higher compression ratio". I do not thin it is true, FSE/ANS achieves slightly better ratios in general.
Zstd uses both Huffman (for large alphabets) and FSE (for small alphabets).
PAQ and PPM are not fast, certainly not in the same category as LZ codecs.
Huffmann is rather simple and hard to beat in decompression speed.
You mean like zstd and brotli ?
Is there any new LZ codec not using Huffman ?