BernoulliZip: a Compression Algorithm for Bernoulli Processes and Erdos-Renyi Graphs

05/14/2021
by   Amirmohammad Farzaneh, et al.
0

A novel compression scheme for compressing the outcome of n independent Bernoulli trials is introduced and analysed. The resulting algorithm, BernoulliZip, is a fast and near-optimal method to produce prefix codes for a Bernoulli process. BernoulliZip's main principle is to first represent the number of 1s in the sequence and then specify the sequence. The application of BernoulliZip on compressing Erdos-Renyi graphs is explored.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2020

On the classification of quaternary optimal Hermitian LCD codes

We propose a method for a classification of quaternary Hermitian LCD cod...
research
12/22/2021

Burling graphs revisited, part III: Applications to χ-boundedness

The Burling sequence is a sequence of triangle-free graphs of unbounded ...
research
02/12/2023

Efficient Integer Retrieving from Unordered Compressed Sequences

The variable-length Reverse Multi-Delimiter (RMD) codes are known to rep...
research
01/13/2023

A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs

Many modern applications involve accessing and processing graphical data...
research
05/29/2019

Solving graph compression via optimal transport

We propose a new approach to graph compression by appeal to optimal tran...
research
07/18/2018

An Information-theoretic Framework for the Lossy Compression of Link Streams

Graph compression is a data analysis technique that consists in the repl...
research
09/21/2019

Universal Lossless Compression of Graphical Data

Graphical data is comprised of a graph with marks on its edges and verti...

Please sign up or login with your details

Forgot password? Click here to reset