State Constraints for the Multiple-Access Arbitrarily Varying Channel.
dc.contributor.author | Gubner, John A. | en_US |
dc.contributor.department | ISR | en_US |
dc.date.accessioned | 2007-05-23T09:43:27Z | |
dc.date.available | 2007-05-23T09:43:27Z | |
dc.date.issued | 1989 | en_US |
dc.description.abstract | It is known that if a multiple-access arbitrarily varying channel is symmetrizable, then the capacity region has an empty interior. In this paper, we show that if a suitable constraint is placed on the channel state sequences, then the capacity region can contain certain open rectangles and thereby possess a nonempty interior. We also prove a new weak converse under a state constraint. We use our results to establish the capacity region of the two-user adder channel under state constraint 1/2. | en_US |
dc.format.extent | 404845 bytes | |
dc.format.mimetype | application/pdf | |
dc.identifier.uri | http://hdl.handle.net/1903/4878 | |
dc.language.iso | en_US | en_US |
dc.relation.ispartofseries | ISR; TR 1989-29 | en_US |
dc.title | State Constraints for the Multiple-Access Arbitrarily Varying Channel. | en_US |
dc.type | Technical Report | en_US |
Files
Original bundle
1 - 1 of 1