Auxiliary-Receiver Outer Bound

• Auxiliary-Receiver Outer Bound is a converse technique for DM-CIFC that introduces a synthetic receiver output to preserve marginal distributions.
• It replaces traditional auxiliary random variables with a fictitious receiver output, enabling computable rate bounds without unresolved cardinality issues.
• Inspired by Sato’s broadcast channel principle, the method is particularly effective in deterministic settings and strong interference regimes.

Searching arXiv for the cited paper and closely related auxiliary-receiver / broadcast-style outer-bound work. The Auxiliary-Receiver Outer Bound is a converse technique for the discrete memoryless cognitive interference channel (DM-CIFC) in which the proof introduces a fictitious receiver output rather than conventional auxiliary random variables. In the formulation given in “New inner and outer bounds for the discrete memoryless cognitive interference channel and some capacity results” (Rini et al., 2010), the method is explicitly motivated by Sato’s idea for the broadcast channel and exploits the fact that, because the receivers do not cooperate, achievability depends only on the single-receiver marginals $P_{Y_1|X_1,X_2}$ and $P_{Y_2|X_1,X_2}$, not on the full joint law of $(Y_1,Y_2)$. This permits replacing the original channel by another with the same receiver marginals but a modified joint coupling, yielding a computable outer bound that avoids unresolved cardinality issues associated with earlier auxiliary-variable converses (Rini et al., 2010).

1. Channel model and converse setting

The bound is defined for the standard two-user discrete memoryless cognitive interference channel. There are two transmitters and two receivers. Transmitter $i$ wishes to send message $W_i$ to receiver $i$, $i\in\{1,2\}$, with independent uniformly distributed messages

$$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$

The key side-information asymmetry is unilateral non-causal message knowledge: transmitter 1, the cognitive transmitter, knows both $W_1$ and $W_2$, whereas transmitter 2, the primary transmitter, knows only $P_{Y_2|X_1,X_2}$0. The encoders are

$P_{Y_2|X_1,X_2}$1

and the decoders satisfy

$P_{Y_2|X_1,X_2}$2

The channel has finite alphabets and memoryless transition law $P_{Y_2|X_1,X_2}$3, and the capacity region is the closure of all achievable rate pairs $P_{Y_2|X_1,X_2}$4 (Rini et al., 2010).

This setting lies between an interference channel and a broadcast channel. Earlier work on the cognitive interference channel already used broadcast-channel-style converse ideas, including receiver-observation auxiliaries such as $P_{Y_2|X_1,X_2}$5 in a Nair–El Gamal-type outer bound (0710.3375). The auxiliary-receiver outer bound of (Rini et al., 2010) departs from that line by replacing auxiliary random variables with an auxiliary output.

2. From auxiliary random variables to an auxiliary receiver

Before introducing the new converse, (Rini et al., 2010) recalls two older general outer bounds. The first is the one-auxiliary-RV bound of Wu et al.,

$P_{Y_2|X_1,X_2}$6

$P_{Y_2|X_1,X_2}$7

$P_{Y_2|X_1,X_2}$8

over distributions $P_{Y_2|X_1,X_2}$9. The second is the broadcast-inspired outer bound of Maric et al., involving auxiliaries $(Y_1,Y_2)$0. The paper emphasizes that these bounds cannot be evaluated in general because no cardinality bounds are known for the auxiliaries (Rini et al., 2010).

That computability issue parallels a well-known theme in broadcast-channel outer bounds. For the 2-receiver DM-BC, the Nair–El Gamal outer bound admits equivalent auxiliary-variable parameterizations and can be made computable only after additional cardinality analysis; in particular, the seemingly stronger $(Y_1,Y_2)$1 formulation is identical to a correlated-$(Y_1,Y_2)$2 formulation, and an equivalent computable form satisfies $(Y_1,Y_2)$3 (0804.3825). In the DM-CIFC, however, the older auxiliary-variable bounds recalled in (Rini et al., 2010) do not come with such cardinality reductions. The auxiliary-receiver construction is introduced precisely to avoid that obstacle.

The resulting tradeoff is explicit. The new outer bound is “looser in general” than the older one-auxiliary-RV bound, but it is explicitly evaluable because it contains no conventional auxiliary random variables. This is the defining feature of the auxiliary-receiver viewpoint: the converse is strengthened by adding a synthetic output variable, not by postulating a latent $(Y_1,Y_2)$4-type code descriptor (Rini et al., 2010).

3. The Sato-style outer bound

The main no-auxiliary outer bound in (Rini et al., 2010) is Theorem $(Y_1,Y_2)$5. If $(Y_1,Y_2)$6 is in the capacity region of the DM-CIFC, then

$(Y_1,Y_2)$7

$(Y_1,Y_2)$8

$(Y_1,Y_2)$9

over the union of all input distributions $i$0 and all conditional distributions $i$1 such that

$i$2

There is no explicit time-sharing variable in the theorem statement (Rini et al., 2010).

The variable $i$3 is the source of the name auxiliary receiver. It is not an auxiliary random variable in the standard converse sense. Rather, it is a fictitious receiver output with the same marginal conditional law as $i$4 but otherwise arbitrary correlation with $i$5 given $i$6. The converse therefore augments the channel with a synthetic second-receiver output and optimizes over all admissible couplings that preserve the $i$7 marginal.

The conceptual basis is Sato’s broadcast-channel principle. Because decoder 1 observes only $i$8 and decoder 2 observes only $i$9, changing the joint dependence between outputs cannot affect achievability so long as the individual marginals are preserved. This is exactly the non-cooperating-receivers premise that makes the construction valid. The essential assumptions are: the channel is memoryless, the receivers do not cooperate, transmitter 1 knows $W_i$0 non-causally, and the modified channel preserves $W_i$1 and $W_i$2 (Rini et al., 2010).

4. Derivation and single-letterization

The converse begins from Fano’s inequality,

$W_i$3

For $W_i$4, the proof uses the cognitive side-information structure and the fact that $W_i$5 is a function of $W_i$6: $W_i$7

$W_i$8

By memorylessness and single-letterization,

$W_i$9

For $i$0, the proof gives

$i$1

$i$2

hence

$i$3

This term is weaker than the earlier $i$4, but it avoids auxiliaries (Rini et al., 2010).

The sum-rate proof is where the auxiliary receiver enters. Let $i$5 satisfy

$i$6

Then

$i$7

$i$8

$i$9

Using the fact that $i\in\{1,2\}$0 and $i\in\{1,2\}$1 have the same conditional law given $i\in\{1,2\}$2, the proof converts the resulting entropies to expressions involving $i\in\{1,2\}$3, inserts the codewords, and obtains

$i\in\{1,2\}$4

Single-letterization yields

$i\in\{1,2\}$5

The proof introduces a time index during single-letterization, but not a theorem-level time-sharing variable (Rini et al., 2010).

5. Relation to earlier and later outer bounds

The new outer bound is explicitly compared with the older one-auxiliary-RV converse in (Rini et al., 2010). For fixed $i\in\{1,2\}$6,

$i\in\{1,2\}$7

so the $i\in\{1,2\}$8 inequalities coincide. For $i\in\{1,2\}$9,

$$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$0

using the Markov chain

$$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$1

hence the new $$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$2 bound is weaker. The paper also shows that the old sum-rate bound is contained in the new one after suitable choice of $$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$3. Accordingly, the new outer region is a superset of the older one and is therefore weaker in general (Rini et al., 2010).

The paper also identifies a regime where the new bound collapses to the strong-interference converse. If

$$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$4

then

$$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$5

and setting $$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$6 gives

$$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$7

The sum-rate inequality reduces to

$$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$8

together with

$$W_i \sim \text{Unif}[1,\ldots,2^{N R_i}], \qquad i\in\{1,2\}.$$9

which is exactly the strong-interference outer bound (Rini et al., 2010).

The method later became useful beyond the original DM-CIFC context. In the sum-broadcast-channel setting, an auxiliary-receiver outer bound with synthetic receivers $W_1$0 and $W_1$1 was used to obtain converse decompositions that the standard UVW outer bound could not provide; for broad classes of component channels, that outer bound was shown to match Marton’s inner bound (Gohari et al., 11 Jun 2026). This suggests that the original CIFC construction is best understood not as an isolated trick, but as an instance of a broader converse principle: replace difficult auxiliary-variable structure by carefully chosen artificial receiver outputs when marginal preservation or channel composition makes that possible.

6. Tightness, special cases, and limitations

The most important exact specialization in (Rini et al., 2010) is the deterministic cognitive interference channel, where

$W_1$2

Taking $W_1$3 in the outer bound gives

$W_1$4

$W_1$5

$W_1$6

over all $W_1$7. The paper proves achievability of exactly this region, so the auxiliary-receiver outer bound is capacity-achieving for this class (Rini et al., 2010).

By contrast, for the semi-deterministic CIFC, where only

$W_1$8

the paper does not use the new bound as the sharp converse. Instead it uses the older Wu auxiliary-variable outer bound to obtain

$W_1$9

$W_2$0

$W_2$1

which yields the capacity region for that regime. Likewise, capacity in the “better cognitive decoding” regime is established with the older one-auxiliary-RV outer bound under the condition

$W_2$2

These results make the paper’s own assessment clear: the auxiliary-receiver outer bound is a general-purpose computable converse, but not always the sharpest available one (Rini et al., 2010).

A common misconception is that eliminating auxiliary random variables necessarily strengthens a converse by simplifying it. The paper shows the opposite tradeoff. The gain is explicit evaluability and freedom from unresolved cardinality bounds; the price is weaker general tightness. A plausible implication is that the method is most valuable when computability is itself essential, or when the channel has structural properties—such as determinism or strong interference—that force the synthetic-output coupling to become exact.

7. Conceptual significance

The auxiliary-receiver outer bound is best viewed as a Sato-style marginal-preserving converse for channels with non-cooperating receivers. Its novelty is not an additional coding idea but a different kind of converse object. Instead of introducing a latent auxiliary that summarizes codebook structure, it introduces an alternative receiver output that preserves the observable marginals while altering the joint law in a converse-friendly way. In the DM-CIFC, this yields the computable region

$W_2$3

with $W_2$4 constrained only by

$W_2$5

In that precise sense, the term auxiliary-receiver outer bound is apt. The auxiliary object is a receiver output, not a conventional random variable. The method inherits the broadcast-channel intuition that only receiver marginals matter when decoders are separate, but adapts it to the cognitive interference setting where one encoder knows both messages non-causally. Its enduring significance lies in demonstrating that computable converses can sometimes be obtained by augmenting the output side of the model rather than the latent-variable side, a design choice later reused in broader broadcast-channel constructions [(Rini et al., 2010); (Gohari et al., 11 Jun 2026)].