BernoulliZip: a Compression Algorithm for Bernoulli Processes and Erdos-Renyi Graphs
Information Theory
2021-05-17 v1 math.IT
Abstract
A novel compression scheme for compressing the outcome of 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.
Keywords
Cite
@article{arxiv.2105.06708,
title = {BernoulliZip: a Compression Algorithm for Bernoulli Processes and Erdos-Renyi Graphs},
author = {Amirmohammad Farzaneh and Mihai-Alin Badiu and Justin P. Coon},
journal= {arXiv preprint arXiv:2105.06708},
year = {2021}
}
Comments
Submitted to ITW 2021