State Constraints for the Multiple-Access Arbitrarily Varying Channel.

dc.contributor.authorGubner, John A.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:43:27Z
dc.date.available2007-05-23T09:43:27Z
dc.date.issued1989en_US
dc.description.abstractIt 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.extent404845 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4878
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1989-29en_US
dc.titleState Constraints for the Multiple-Access Arbitrarily Varying Channel.en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR_89-29.pdf
Size:
395.36 KB
Format:
Adobe Portable Document Format