BernoulliZip: a Compression Algorithm for Bernoulli Processes and Erdos-Renyi Graphs
Abstract
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.