5 ms·

Asymmetric numeral systems: entropy encoding (2013)

• beagle3 10y ago
  (2013). Already in practical use.
  • sp332 10y ago
    Does it get us the advantages of arithmetic coding without the patents?
    • aab0 10y ago
      Is arithmetic coding still patented? I remember hearing about it being patented along with GIF back in like the '90s, but patents don't last that long - it's 2016, even GIF is out of patent now.
      • deleted 10y ago
        [deleted]
      • sp332 10y ago
        Man, that was more complex than I thought. Looks like various methods of doing the coding were patented at different times. https://en.wikipedia.org/wiki/Arithmetic_coding#US_patents https://en.wikipedia.org/wiki/Arithmetic_coding#US_patents All the ones listed there are expired, so that's a good sign I guess.
• muizelaar 10y ago
  This was popularized by Yann Collet's work on https://github.com/Cyan4973/FiniteStateEntropy https://github.com/Cyan4973/FiniteStateEntropy
• algorithm314 10y ago
  detailed list of implementations found http://encode.ru/threads/2078-List-of-Asymmetric-Numeral-Systems-implementations http://encode.ru/threads/2078-List-of-Asymmetric-Numeral-Sys...
• PaulHoule 10y ago
  Woohoo!
• cyphar 10y ago
  Does anyone know if this is patent-encumbered?
• powturbo 10y ago
  Almost all current implementations (except TurboANX) are in general not better than huffman coding. See: https://sites.google.com/site/powturbo/entropy-coder https://sites.google.com/site/powturbo/entropy-coder Better test this yourself on your own data with TurboBench: https://github.com/powturbo/TurboBench https://github.com/powturbo/TurboBench