Capacity and decoding rules for classes of arbitrarily varying channels

DOI10.1109/18.32153MaRDI QIDQ4735128zbMATH OpenOpenAlexFDO

Authors Imre Csiszár, Prakash Narayan

Publication date 1989

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

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

zbMATH Keywords

capacity of an arbitrarily varying channeldecoding rulesdeterministic codesgroup adder channelsmutual information gameOR channelsprobability of error

Mathematics Subject Classification ID

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

Recommendations

• Capacity and decoding rules for the poisson arbitrarily varying channel
• Capacity of the arbitrarily varying channel under list decoding
• On error exponents for arbitrarily varying channels
• Arbitrarily varying channels with general alphabets and states
• The capacity of the arbitrarily varying channel revisited: positivity, constraints

Cited in

(11)

• Capacity and coding for the gilbert-elliott channels
• Capacity and decoding rules for the poisson arbitrarily varying channel
• On the Capacity Loss Due to Separation of Detection and Decoding
• Oblivious Communication Channels and Their Capacity
• The capacities of certain special channels with arbitrarily varying channel probability functions
• The capacity of coded systems
• On error exponents for arbitrarily varying channels
• Basic concepts and mathematical aspects in channel coding: multialternative rules
• Capacity-Achieving Guessing Random Additive Noise Decoding
• Capacity Analysis For Orthogonal Halftone Orientation Modulation Channels
• Codes for adversaries: between worst-case and average-case jamming

This page was built for publication: Capacity and decoding rules for classes of arbitrarily varying channels

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