← Latest papers
🔢 mathematics

Capacity of Uniform Noise Channels Under Average Input Power Constraints

This paper resolves the long-standing open problem of determining the capacity of additive uniform noise channels under average input power constraints by precisely characterizing the capacity and the corresponding optimal input and output distributions through a novel periodization identity and Fourier analytic techniques.

Original authors: Yihan Zhang

Published 2026-07-17
📖 3 min read🧠 Deep dive

Original authors: Yihan Zhang

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to send a secret message across a noisy room. You whisper a word to a friend, but the air is filled with static, wind, and the clatter of dishes. This is the world of information theory, the science of how much data we can squeeze through a channel before the noise garbles it beyond repair. The "capacity" of a channel is like the maximum speed limit for your message; if you try to go faster, the message breaks. For decades, scientists knew the speed limit perfectly when the noise was "Gaussian"—a fancy way of saying the noise is a smooth, bell-shaped cloud of randomness, like the way raindrops might fall on a roof. But what if the noise isn't a smooth cloud? What if it's a flat, uniform block of static, like a radio tuned exactly between two stations where the sound is just a steady, unchanging hiss? This specific type of noise, called "uniform noise," has been a stubborn puzzle. While we knew how to handle it if the message had a strict volume limit, figuring out the speed limit when the message just has an average energy limit (like a battery that can't drain too fast on average) had remained a mystery for a long time.

This paper finally solves that mystery. The author, Yihan Zhang, acts like a detective who finds a hidden pattern in the static. The key discovery is a surprising mathematical trick: no matter what message you send, if you mix it with this specific "flat" noise, the resulting sound has a hidden rhythm. If you were to look at the sound waves and stack them up in a specific, repeating way (like tiling a floor), they would always form a perfectly flat, constant line. This "periodization identity" is the magic key. It allows the author to use advanced math tools (Fourier analysis) to calculate the exact maximum speed limit for this channel.

The paper proves that the best way to send a message through this uniform noise is not with a simple, smooth wave like a Gaussian bell curve, nor is it with a series of sharp, discrete clicks. Instead, the perfect message shape is a unique, smooth, and absolutely continuous curve that looks a bit like a bell curve but has a very specific, wavy texture underneath. The paper provides the exact mathematical recipe for this perfect message shape and the exact speed limit it achieves. It also explicitly rules out the idea that the answer is a simple discrete set of points (which happens in other types of noise problems) or a standard Gaussian distribution. The author has not just guessed or simulated this; they have provided a rigorous mathematical proof that this specific input and output distribution is the only one that works, settling a question that had been open for years.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →