Huffman-Coded Sphere Shaping and Distribution Matching Algorithms via Lookup Tables
نویسندگان
چکیده
منابع مشابه
Iterating Lookup Tables Efficiently
We show that every function f implemented as a lookup table can, by increasing the storage space by a small constant factor, be implemented such that the computational complexity of evaluating fm(x) is small independently of m and x.
متن کاملOblivious Lookup Tables
We consider the following question: given a group-homomorphic public-key encryption E, a ciphertext c = E(x, pk) hiding a value x using a key pk, and a ”suitable” description of a function f , can we evaluate E(f(x), pk) without decrypting c? We call this an oblivious lookup table and show the existence of such a primitive. To this end, we describe a concrete construction, discuss its security ...
متن کاملStatistical Modeling of Huffman Tables Coding
An innovative algorithm for automatic generation of Huffman coding tables for semantic classes of digital images is presented. Collecting statistics over a large dataset of corresponding images, we generated Huffman tables for three images classes: landscape, portrait and document. Comparisons between the new tables and the JPEG standard coding tables, using also different quality settings, hav...
متن کاملLevel compressed DAGs for lookup tables
Trie-based data structures for implementing IP lookups have attracted considerable research aUention. Techniques such as path compression, level compression, generalized level compression, and controlled prefix expansion are commonly used to implement lookup tables. [0 this paper, we present a fundamentally new technique that relies on directed acyclic graphs (DAGs). which, when coupled with ge...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Lightwave Technology
سال: 2020
ISSN: 0733-8724,1558-2213
DOI: 10.1109/jlt.2020.2987210