Abstract:
The article deals with the problem of optimum coding of a source for whose symbols it is known only that they are arranged in decreasing order of probability. On the basis of the resultant code, a design for a universal retrieval system is proposed and a hypothesis that accounts for Zipf’s law is advanced.