Distribution Matching

An algorithmic process that maps sequences of uniformly distributed input bits into sequences of symbols (or bit patterns) whose empirical distribution approximates a prescribed non‑uniform target distribution (used e.g. for probabilistic shaping), while remaining invertible (or otherwise recoverable) at the receiver and with quantifiable rate loss, complexity and latency properties.