Optimal Compression for Two-Field Entries in Fixed-Width Memories

Data compression is a well-studied (and well-solved) problem in the setup of long coding blocks. But important emerging applications need to compress data to memory words of small fixed widths. This new setup is the subject of this paper. In the problem we consider, we have two sources with known di...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE transactions on information theory Vol. 64; no. 6; pp. 4309 - 4322
Main Authors:	Rottenstreich, Ori, Cassuto, Yuval
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.06.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Codes Compression algorithms Data compression Decoding Dictionaries fixed-width memories Heuristic algorithms Huffman coding Machine learning network switches and routers Optimization Random access memory Routers Switches table compression Tables
ISSN:	0018-9448, 1557-9654
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!