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
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.