首页> 外文会议>IEEE International Symposium on Information Theory >Universal Compression for I. I. D. Sources with Large Alphabets
【24h】

Universal Compression for I. I. D. Sources with Large Alphabets

机译:I. I. I. D.具有大字母表的普遍压缩

获取原文

摘要

The Minimum Description Length (MDL) principle is derived for universal compression of i. i. d. sources with large alphabets of size k that may be up to sub-linear with the data sequence length n. Each unknown source probability parameter is shown to cost 0.5log(n/k) bits. This result is shown to be a lower bound in the average minimax sense, and also for most sources in the class. The bound is shown to be achievable even sequentially with the well-known Krichevsky-Trofimov low-complexity scheme.
机译:最小描述长度(MDL)原理是因为I的通用压缩。一世。天。具有大小k的大字母k的来源,其可以与数据序列长度n具有子线性n。每个未知的源概率参数显示为成本0.5升(n / k)位。该结果显示在平均值最小的义上是下限,也是类中的大多数源。甚至与众所周知的Krichevsky-Trofimov低复杂性方案顺序地依次可实现的界限。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号