Broadcast Channels.
Abstract
The author introduces the problem of a single source attempting to communicate information simultaneously to several receivers. Thus several different channels with a common input alphabet are specified. The intent is to model the situation of a broadcaster with multiple receivers or a lecturer with many listners. The transmitter may or may not be attempting to communicate the same information to each receiver. One shall determine the families of simultaneously achievable transmission rates for many extreme classes of channels including orthogonal channels and incompatible channels. It will be found that the family of theoretically achievable rates dominates the family of rates achievable by previously known time-sharing and minimax procedures. This improvement is gained by superimposing high rate information on low rate information. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 20, 1971
- Accession Number
- AD0724737
Entities
People
- Thomas M. Cover
Organizations
- Stanford University