Abstract
Let A = {1,..., a}, B = {1,..., b}, and C = {1,..., c}. Let w1(· | ·) be the c.p.f. of a d.m.c. A → B, and w2(· | ·) the c.p.f. of a d.m.c. B → C. Write A *n for the Cartesian product of n A’s, with similar definitions for B *n , C *n , and, later, for D * n . There are three individuals I, II, III who act as follows: I wishes to send to II an arbitrarily chosen pair (i, j) of messages over the d.m.c. w1(·|·), and the message j to III over the d.m.c. w3(·|·), where
.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1978 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wolfowitz, J. (1978). Degraded Broadcast Channels. In: Coding Theorems of Information Theory. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol 31. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-66822-7_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-66822-7_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-66824-1
Online ISBN: 978-3-642-66822-7
eBook Packages: Springer Book Archive