Large Alphabets and Incompressibility
| dc.creator | Gagie, Travis | |
| dc.date | 2005-06-14 | |
| dc.date | 2006-03-09 | |
| dc.date.accessioned | 2026-07-07T08:17:48Z | |
| dc.date.available | 2026-07-07T08:17:48Z | |
| dc.description | 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 $\ell$th-order empirical entropy stops being a reasonable complexity metric for almost all strings of length $m$ over alphabets of size $n$ about when $n^\ell$ surpasses $m$. | |
| dc.identifier | https://arxiv.org/abs/cs/0506056 | |
| dc.identifier | http://arxiv.org/abs/cs/0506056 | |
| dc.identifier | doi:10.1016/j.ipl.2006.04.008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134219 | |
| dc.subject | Information Theory | |
| dc.subject | E.4 | |
| dc.title | Large Alphabets and Incompressibility | |
| dc.type | text |