Arbitrarily varying channels with general alphabets and states
type: Item
instance of: scholarly article
title: Arbitrarily varying channels with general alphabets and states
zbMATH Open document ID: 0759.94002
DOI: 10.1109/18.165446
author: Imre Csiszár
published in: IEEE Transactions on Information Theory
publication date: 1993-02-04T00:00:00Z
Mathematics Subject Classification ID: 94A40
zbMATH DE Number: 110453
zbMATH Keywords: continuous alphabet
zbMATH Keywords: simultaneous constraints
zbMATH Keywords: vector channel
zbMATH Keywords: capacity of discrete arbitrarily varying channels
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1109/18.165446
OpenAlex ID: W2076524464
Recommended article: Arbitrarily varying channels with constrained inputs and states
Recommended article: Arbitrarily varying channels with states sequence known to the sender
Recommended article: Semi-continuous arbitrarily varying channels with general state constraints
Recommended article: Q3487275
Recommended article: Channels with arbitrarily varying channel probability functions
Recommended article: Generalized channels: channels for convex subsets of the state space
Recommended article: State constraints for the multiple-access arbitrarily varying channel
Recommended article: Arbitrarily Varying Wiretap Channels With Type Constrained States
Recommended article: The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
Recommended article: A Randomized Algorithm for the Capacity of Finite-State Channels
description: scientific article