无限符号集的编码方案：无限完美二叉树上的逾渗过程
Encoding Scheme for Infinite Set of Symbols: The Percolation Process on Infinite Perfect Binary Trees
摘要：
它在这里示出，从无限完美二叉树上的渗透过程中出现的渗透集群，是真正的一个无限符号集的编码方案。只要渗透密度$p$在$1/2\leq p < \sqrt[3]{1/4}$之间，这种编码方案的平均码字长度和熵仍然是有限的。
英文摘要：
It is shown here that the percolation cluster that emerges from the percolation process on infinite perfect binary trees, is genuinely an encoding scheme for an infinite set of symbols. The average codeword length and the entropy of such an encoding scheme are still finite as long as the percolation density $p$ is between $1/2\leq p < \sqrt[3]{1/4}$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
