The capacity region of a class of broadcast channels with a sequence of less noisy receivers

TL;DR

This paper determines the capacity region for a specific class of three-receiver broadcast channels with less noisy receivers, proving superposition coding's optimality in this context.

Contribution

It solves the open problem of the capacity region for three-receiver less noisy broadcast channels and establishes superposition coding as optimal for this class.

Findings

Capacity region explicitly characterized for three-receiver less noisy channels.

Superposition coding proven to be optimal for this class.

Extends understanding of broadcast channel capacity limits.

Abstract

The capacity region of a broadcast channel consisting of k-receivers that lie in a less noisy sequence is an open problem, when k >= 3. We solve this problem for the case k=3. We prove that superposition coding is optimal for a class of broadcast channels with a sequence of less noisy receivers. T