Arbitrarily Varying Channels with Constrained Inputs and States.

Simple item page
dc.contributor.authorCsiszar, Imreen_US
dc.contributor.authorNarayan, P.en_US
dc.contributor.departmentISRen_US
dc.date.accessioned2007-05-23T09:37:47Z
dc.date.available2007-05-23T09:37:47Z
dc.date.issued1987en_US
dc.description.abstractRandom coding theorems are proved for discrete memoryless arbitrarily varying channels (AVCs) with constraints on the transmitted codewords and channel state sequences. We consider two types of constraints: peak (i.e., required for each n-length sequence almost surely) and average (over the messege set or over an ensemble). For peak constraints on the codewords and on the channel state sequences, the AVC is shown to have a (strong) random coding capacity. If the codewords and/or the channel state sequences are constrained in the average sense, the AVCs do not possess (strong) capacities; only EPSILON-capacities are shown to exist.en_US
dc.format.extent836026 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/4599
dc.language.isoen_USen_US
dc.relation.ispartofseriesISR; TR 1987-91en_US
dc.titleArbitrarily Varying Channels with Constrained Inputs and States.en_US
dc.typeTechnical Reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR_87-91.pdf
Size:
816.43 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports