Large Alphabets and Incompressibility
信息论
2007-07-16 v3 math.IT
摘要
We briefly survey some concepts related to empirical entropy -- normal numbers, de Bruijn sequences and Markov processes -- and investigate how well it approximates Kolmogorov complexity. Our results suggest th-order empirical entropy stops being a reasonable complexity metric for almost all strings of length over alphabets of size about when surpasses .
关键词
引用
@article{arxiv.cs/0506056,
title = {Large Alphabets and Incompressibility},
author = {Travis Gagie},
journal= {arXiv preprint arXiv:cs/0506056},
year = {2007}
}