# Probability Mass Functions for which Sources have the Maximum Minimum Expected Length

Source: [Probability Mass Functions for which Sources have the Maximum Minimum Expected Length](<https://www.sota2.com/research/paper/68fa55b11e209131ce99642f>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-27T05:09:52.496Z

Authors: Shivkumar K. Manickam

Published: 2019-03-09T07:49:52.000Z

## Abstract

Let $\\mathcal{P}\_n$ be the set of all probability mass functions (PMFs) $(p\_1,p\_2,\\ldots,p\_n)$ that satisfy $p\_i\>0$ for $1\\leq i \\leq n$. Define the minimum expected length function $\\mathcal{L}\_D :\\mathcal{P}\_n \\rightarrow \\mathbb{R}$ such that $\\mathcal{L}\_D (P)$ is the minimum expected length of a prefix code, formed out of an alphabet of size $D$, for the discrete memoryless source having $P$ as its source distribution. It is well-known that the function $\\mathcal{L}\_D$ attains its maximum value at the uniform distribution. Further, when $n$ is of the form $D^m$, with $m$ being a positive integer, PMFs other than the uniform distribution at which $\\mathcal{L}\_D$ attains its maximum value are known. However, a complete characterization of all such PMFs at which the minimum expected length function attains its maximum value has not been done so far. This is done in this paper.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1903.03755>)

[PDF](<https://arxiv.org/pdf/1903.03755.pdf>)
