The Capacity of a Class of Channels

DOI10.1214/AOMS/1177706106MaRDI QIDQ3288438zbMATH OpenOpenAlexFDO

Authors Leo Breiman, Aram John Thomasian, D. Blackwell

Publication date 1959

Published in Annals of Mathematical Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoms/1177706106

zbMATH Keywords

probability theory

Cited in

(14)

• Entanglement transmission and generation under channel uncertainty: universal quantum channel coding
• Capacities: From information theory to extremal set theory
• Over-the-Air computation for distributed machine learning and consensus in large wireless networks
• Arbitrarily varying multiple access channels with conferencing encoders: list decoding and finite coordination resources
• Secrecy results for compound wiretap channels
• Elimination of correlation in random codes for arbitrarily varying channels
• Secret message transmission over quantum channels under adversarial quantum noise: Secrecy capacity and super-activation
• Universal coding for transmission of private information
• Me\fehler und Information
• Coding theorems for the compound semi-continuous memoryless channels
• Beitr�ge zur Shannonschen Informationstheorie im Falle nichtstation�rer Kan�le
• The weak capacity of averaged channels
• Die Kapazit�t der periodischen Kan�le
• Codes for adversaries: between worst-case and average-case jamming

This page was built for publication: The Capacity of a Class of Channels

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