degraded-wiretap-channel

Degraded discrete memoryless wiretap channel

A sender communicates reliably to a legitimate receiver while hiding the message from a degraded eavesdropper.

Wiretap Finite alphabet Discrete memoryless Degraded Secrecy Secrecy capacity Exact Single-letter characterization

Channel and question

Input
\(X\in\mathcal X\)
Output
Legitimate output \(Y\) and eavesdropper output \(Z\).
Law
The channel is memoryless and physically degraded: \(X\to Y\to Z\).
Quantity
Secrecy capacity \(C_s\), measured in secret bits per channel use.

Criterion. Reliable communication with asymptotically vanishing leakage.

  • Reliability is required at Y.
  • Information leakage to Z vanishes under the stated secrecy criterion.

Current status

\[C_s=\max_{P_X}\bigl[I(X;Y)-I(X;Z)\bigr]\]

Conditions. The channel is physically degraded.

Known results and bounds for Degraded discrete memoryless wiretap channel
ResultRelationMethodYear
Lower\(C_s\ge\max_{P_X}[I(X;Y)-I(X;Z)]\)Stochastic encoding and random binning.1975
Upper\(C_s\le\max_{P_X}[I(X;Y)-I(X;Z)]\)Fano's inequality, secrecy, and degradedness.1975

Formal verification

Lean coverageFormally stated

Concrete operational definitions and admitted research statements are present. Existing proofs are preserved. New statements require mathematical review and proof completion.

Claims

  • The degraded finite wiretap formula with unnormalized leakage tending to zero.
    operational-capacity · exact capacity · solved · Formally stated · v1
Lean declarations (1)

References

  1. Aaron D. Wyner (1975). The Wire-Tap Channel. Bell System Technical Journal. DOI 10.1002/j.1538-7305.1975.tb02040.x.
  2. Abbas El Gamal and Young-Han Kim (2011). Network Information Theory. Cambridge University Press. DOI 10.1017/CBO9781139030687.

Discussion

Related problems

A Gaussian receiver has a lower noise variance than the eavesdropper, yielding a closed-form secrecy capacity.

Wiretap Continuous alphabet Gaussian Degraded Secrecy Power constraint Secrecy capacity Exact
Solved \(C_s=\frac12\log_2\!\left(1+\frac{P}{\sigma_1^2}\right)-\frac12\log_2\!\left(1+\frac{P}{\sigma_2^2}\right)\)

The unconstrained finite wiretap channel has a single-auxiliary secrecy-capacity characterization without a degradedness assumption.

Wiretap Finite alphabet Discrete memoryless Secrecy Secrecy capacity Exact Single-letter characterization
Solved \(C_s=\max_{V-X-(Y,Z)}\bigl[I(V;Y)-I(V;Z)\bigr]\)
Binary Z-channel Z-channel

One binary symbol is transmitted perfectly while the other can flip in only one direction.

Point-to-point Binary Finite alphabet Discrete memoryless Asymmetric Capacity Exact
Solved \(C_Z(p)=\log_2\!\left(1+(1-p)p^{p/(1-p)}\right)\)