2 papers
cs.IT2023
Coding for IBLTs with Listing Guarantees
Daniella Bar-Lev, Avi Mizrahi, Tuvi Etzion +2
The Invertible Bloom Lookup Table (IBLT) is a probabilistic data structure for set representation, with applications in network and traffic monitoring. It is known for its ability…
cs.IT2017
Optimal Compression for Two-Field Entries in Fixed-Width Memories
Ori Rottenstreich, Yuval Cassuto
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…