Capacity for Classes of Broadcast Channels with Receiver Side Information

Methods are developed that achieve all rate points inside the capacity region of two-receiver memoryless broadcast channels where each receiver knows the message it need not decode. The capacity result generalizes to channels with per-letter average cost constraints, e.g., additive white Gaussian noise channels with power constraints. The result further generalizes to cases where the receivers have only partial message information and where one receiver must decode both messages.