论文标题

非序列无损压缩的十二倍方式

The Twelvefold Way of Non-Sequential Lossless Compression

论文作者

Rahman, Taha Ameen ur, Barbehenn, Alton S., Chen, Xinan, Dbouk, Hassan, Douglas, James A., Geng, Yuncong, George, Ian, Harvill, John B., Jeon, Sung Woo, Kansal, Kartik K., Lee, Kiwook, Levick, Kelly A., Li, Bochao, Li, Ziyue, Murthy, Yashaswini, Muthuveeru-Subramaniam, Adarsh, Olmez, S. Yagiz, Tomei, Matthew J., Veeravalli, Tanya, Wang, Xuechao, Wayman, Eric A., Wu, Fan, Xu, Peng, Yan, Shen, Zhang, Heling, Zhang, Yibo, Zhang, Yifan, Zhao, Yibo, Basu, Sourya, Varshney, Lav R.

论文摘要

许多信息源不仅是可区分符号的序列,而且具有受替代计数范式(例如排列,组合和分区)的态度。我们考虑了这些不变的整个分类,称为枚举组合学中的十二折言,并开发了一种表征无损压缩极限的方法。对I.I.D进行所有十二个设置的明确计算。统一和伯努利分布。设置之间的比较提供了定量的见解。

Many information sources are not just sequences of distinguishable symbols but rather have invariances governed by alternative counting paradigms such as permutations, combinations, and partitions. We consider an entire classification of these invariances called the twelvefold way in enumerative combinatorics and develop a method to characterize lossless compression limits. Explicit computations for all twelve settings are carried out for i.i.d. uniform and Bernoulli distributions. Comparisons among settings provide quantitative insight.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源