
TL;DR
This paper introduces asymmetric numeral systems (ANS), a new entropy coding method that simplifies encoding, enhances speed, and supports encryption, achieving near Shannon limit error correction with linear time complexity.
Contribution
The paper presents ANS, a universal and efficient entropy coding approach that generalizes standard numeral systems, enabling both high-precision encoding and fast, encrypted data processing.
Findings
ANS simplifies encoder design by using a single state.
ANS can be tuned for various speed and accuracy requirements.
ANS achieves near Shannon limit error correction with linear time complexity.
Abstract
In this paper will be presented new approach to entropy coding: family of generalizations of standard numeral systems which are optimal for encoding sequence of equiprobable symbols, into asymmetric numeral systems - optimal for freely chosen probability distributions of symbols. It has some similarities to Range Coding but instead of encoding symbol in choosing a range, we spread these ranges uniformly over the whole interval. This leads to simpler encoder - instead of using two states to define range, we need only one. This approach is very universal - we can obtain from extremely precise encoding (ABS) to extremely fast with possibility to additionally encrypt the data (ANS). This encryption uses the key to initialize random number generator, which is used to calculate the coding tables. Such preinitialized encryption has additional advantage: is resistant to brute force attack - to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · semigroups and automata theory · Cellular Automata and Applications
