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.

翻译：引入并分析压缩独立伯努利审判结果的新压缩计划。 由此产生的算法伯努利日普( BernoulliZip) 是一个快速和接近最佳的方法,可以生成伯努利进程前缀代码。 伯努利日普( BernoulliZip) 的主要原则是首先代表序列中的 1 个数, 然后指定序列。 探索伯努利日普( BernoulliZip) 如何压缩 Erdos- Renyi 图形 。