On the public citation graph
The weak capacity of averaged channels
0 signed · 52 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00572920openalex-snapshot
Beitr�ge zur Shannonschen Informationstheorie im Falle nichtstation�rer Kan�le
inferredcites →https://doi.org/10.1016/s0019-9958(61)80005-3openalex-snapshot
Some remarks on the capacity of compound channels in the semicontinuous case
inferredcites →https://doi.org/10.1016/s0019-9958(62)90203-6openalex-snapshot
Channels with arbitrarily varying channel probability functions
inferredcites →https://doi.org/10.1016/s0019-9958(63)90101-3openalex-snapshot
On channels without a capacity
inferredcites →https://doi.org/10.1137/1107026openalex-snapshot
On the Information Stability of a Sequence of Channels
inferredcites →https://doi.org/10.1214/aoms/1177706106openalex-snapshot
The Capacity of a Class of Channels
inferredcites →https://doi.org/10.1215/ijm/1255380682openalex-snapshot
The coding of messages subject to chance errors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11889342_40openalex-snapshot
On Concepts of Performance Parameters for Channels
inferred← citeshttps://doi.org/10.1007/978-3-030-00312-8_2openalex-snapshot
Random Correlated Codes for the AVC and the Compound Channels
inferred← citeshttps://doi.org/10.1007/978-3-030-00312-8_8openalex-snapshot
Applications and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-05479-7_6openalex-snapshot
Towards Capacity Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-12523-7_6openalex-snapshot
Channels with Infinite Alphabets
inferred← citeshttps://doi.org/10.1007/s10955-009-9726-0openalex-snapshot
Classical Capacity of Quantum Channels with General Markovian Correlated Noise
inferred← citeshttps://doi.org/10.1007/s11128-008-0086-5openalex-snapshot
Entanglement assisted classical capacity of a class of quantum channels with long-term memory
inferred← citeshttps://doi.org/10.1007/s11276-018-1677-4openalex-snapshot
Expected distortion of simultaneous transmission of multiple source symbols with multicarrier frequency hopping modulation
inferred← citeshttps://doi.org/10.1016/s0019-9958(74)80006-9openalex-snapshot
A general formula for the capacity of stationary nonanticipatory channels
inferred← citeshttps://doi.org/10.1016/s0019-9958(77)90505-8openalex-snapshot
On sliding block coding for transmission of a source over a stationary nonanticipatory channel
inferred← citeshttps://doi.org/10.1017/s0021900200096017openalex-snapshot
Channel capacities for list codes
inferred← citeshttps://doi.org/10.1038/s41467-018-03428-0openalex-snapshot
Memory effects can make the transmission capability of a communication channel uncomputable
inferred← citeshttps://doi.org/10.1088/1751-8113/40/28/s20openalex-snapshot
The coding theorem for a class of quantum channels with long-term memory
inferred← citeshttps://doi.org/10.1103/revmodphys.86.1203openalex-snapshot
Quantum channels and memory effects
inferred← citeshttps://doi.org/10.1109/18.2598openalex-snapshot
Arbitrarily varying channels with constrained inputs and states
inferred← citeshttps://doi.org/10.1109/18.335960openalex-snapshot
A general formula for channel capacity
inferred← citeshttps://doi.org/10.1109/18.340476openalex-snapshot
A communication channel modeled on contagion
inferred← citeshttps://doi.org/10.1109/glocom.2008.ecp.188openalex-snapshot
Generalized Capacity and Source-Channel Coding for Packet Erasure Channels
inferred← citeshttps://doi.org/10.1109/icassp39728.2021.9413887openalex-snapshot
Communication Over Block Fading Channels – An Algorithmic Perspective On Optimal Transmission Schemes
inferred← citeshttps://doi.org/10.1109/isit.2007.4557342openalex-snapshot
Capacity Definitions of General Channels with Receiver Side Information
inferred← citeshttps://doi.org/10.1109/isit.2008.4594953openalex-snapshot
Classical capacity of averaged quantum channels
inferred← citeshttps://doi.org/10.1109/isit.2011.6033798openalex-snapshot
On the asymptotic error probability of composite relay channels
inferred← citeshttps://doi.org/10.1109/isit.2014.6875359openalex-snapshot
Single-letter characterization of epsilon-capacity for mixed memoryless channels
inferred← citeshttps://doi.org/10.1109/isit.2015.7283001openalex-snapshot
First- and second-order coding theorems for mixed memoryless channels with general mixture
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174155openalex-snapshot
The Arbitrarily Varying Channel With Colored Gaussian Noise
inferred← citeshttps://doi.org/10.1109/ita.2018.8502953openalex-snapshot
Linear Programming Based Finite Blocklength Converses in Information Theory
inferred← citeshttps://doi.org/10.1109/itw.2007.4313135openalex-snapshot
Distortion Metrics of Composite Channels with Receiver Side Information
inferred← citeshttps://doi.org/10.1109/itw.2012.6404645openalex-snapshot
On the asymptotic spectrum of the error probability of composite networks
inferred← citeshttps://doi.org/10.1109/itw.2017.8277964openalex-snapshot
Linear programming based finite blocklength converses for some network-like problems
inferred← citeshttps://doi.org/10.1109/tifs.2018.2797004openalex-snapshot
Secure Identification for Wiretap Channels; Robustness, Super-Additivity and Continuity
inferred← citeshttps://doi.org/10.1109/tit.1979.1056045openalex-snapshot
Block coding for discrete stationaryd-continuous noisy channels
inferred← citeshttps://doi.org/10.1109/tit.2006.887087openalex-snapshot
$\epsilon$-Capacity of Binary Symmetric Averaged Channels
inferred← citeshttps://doi.org/10.1109/tit.2009.2021375openalex-snapshot
Classical Capacities of Compound and Averaged Quantum Channels
inferred← citeshttps://doi.org/10.1109/tit.2010.2046220openalex-snapshot
Variable-Rate Channel Capacity
inferred← citeshttps://doi.org/10.1109/tit.2010.2048456openalex-snapshot
Generalizing Capacity: New Definitions and Capacity Theorems for Composite Channels
inferred← citeshttps://doi.org/10.1109/tit.2014.2368564openalex-snapshot
Mixed Noisy Network Coding and Cooperative Unicasting in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tit.2016.2573310openalex-snapshot
First- and Second-Order Coding Theorems for Mixed Memoryless Channels With General Mixture
inferred← citeshttps://doi.org/10.1109/tit.2020.2971682openalex-snapshot
Shannon Meets von Neumann: A Minimax Theorem for Channel Coding in the Presence of a Jammer
inferred← citeshttps://doi.org/10.1109/tsp.2020.3027902openalex-snapshot
Communication Under Channel Uncertainty: An Algorithmic Perspective and Effective Construction
inferred← citeshttps://doi.org/10.33232/bims.0066.28.30openalex-snapshot
The Information-carrying capacity of certain quantum channels
inferred← citeshttps://doi.org/10.48550/arxiv.0710.3027openalex-snapshot
Classical Capacities of Averaged and Compound Quantum Channels
inferred← citeshttps://doi.org/10.48550/arxiv.0902.4647openalex-snapshot
Source-Channel Coding and Separation for Generalized Communication Systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.