The problem of designing a fixed code for encoding all monotone sources with a large alphabet size $n$ is studied. It is proved that if the codelengths of a code sequence are of order $O(\log n)$ , then the redundancy for almost all monotone sources with $n$ symbols is very close to that for a specific distribution, so-called average distribution. Noting this point, for any large alphabet size $n$ , a new code with a very simple structure is proposed whose redundancy is close to that of the Huffman code for almost all monotone sources with alphabet size $n$ .

中文翻译：

---

用于编码具有固定大字母大小的所有单调源的新代码

设计一个固定编码对所有大字母表大小的单调源进行编码的问题 $n$ 被研究。证明如果一个码序列的码长是有序的 $O(\log n)$ ，那么几乎所有单调源的冗余 $n$ 符号非常接近特定分布的符号，即所谓的平均分布。注意这一点，对于任何大的字母大小 $n$ ，提出了一种结构非常简单的新代码，其冗余度接近于几乎所有字母大小的单调源的霍夫曼代码 $n$ .