Arbitrarily varying channels with general alphabets and states

DOI10.1109/18.165446zbMATH Open0759.94002OpenAlexW2076524464MaRDI QIDQ4024550

Imre Csiszár

Publication date: 4 February 1993

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.165446

zbMATH Keywords

vector channelcapacity of discrete arbitrarily varying channelscontinuous alphabetsimultaneous constraints

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Related Items (1)

Channels which transmit letters of unequal duration

Recommendations

• Title not available (Why is that?) 👍 👎
• Semi-continuous arbitrarily varying channels with general state constraints 👍 👎
• Generalized channels: channels for convex subsets of the state space 👍 👎
• Arbitrarily Varying Wiretap Channels With Type Constrained States 👍 👎
• A Randomized Algorithm for the Capacity of Finite-State Channels 👍 👎
• State constraints for the multiple-access arbitrarily varying channel 👍 👎
• Channels with arbitrarily varying channel probability functions 👍 👎
• Arbitrarily varying channels with states sequence known to the sender 👍 👎
• Arbitrarily varying channels with constrained inputs and states 👍 👎
• The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet 👍 👎

This page was built for publication: Arbitrarily varying channels with general alphabets and states

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4024550)