IEEE Transactions on Information Theory · 1979 · 639 citations · 10 references
EngineeringChannel Capacity EstimationJoint Source-channel CodingMulti-terminal Information TheoryLinear Network CodingCommunication ComplexityComputational ComplexityChannel CodingComputer ScienceCoding TheoremDiscrete MathematicsCommunicationCoding TheoryBroadcast ChannelsDeterministic Component
A coding theorem for the discrete memoryless broadcast channel is proved for the case where no common message is to he transmitted. The theorem is a generalization of the results of Cover and van der Meulen on this problem. The result is tight for broadcast channels having one deterministic component
10