arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1311.0822nlin.CDcs.ITmath.IT
收藏

最大Lempel-Ziv复杂度字符串的性质

Properties of maximum Lempel-Ziv complexity strings

C. A. J. Nunes, E. Estevez-Rams, B. Aragón Fernández, R. Lora Serrano

摘要:

研究了二元情形下最大Lempel-Ziv复杂度串的性质。MLZ和随机字符串之间的比较进行。两类序列的长度分布具有不同的分布函数。讨论了MLZ的非平稳特性。对噪声的敏感性问题也得到了解决。一个经验的animals被发现,适合所有长度高达$10^6$符号的MLZ的Lempel-Ziv复杂性。

英文摘要:

The properties of maximum Lempel-Ziv complexity strings are studied for the binary case. A comparison between MLZs and random strings is carried out. The length profile of both type of sequences show different distribution functions. The non-stationary character of the MLZs are discussed. The issue of sensitiveness to noise is also addressed. An empirical ansatz is found that fits well to the Lempel-Ziv complexity of the MLZs for all lengths up to $10^6$ symbols.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑