On the public citation graph

The structure of capacity functions for compound channels

https://doi.org/10.1007/bfb0079115
0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-642-66822-7openalex-snapshot
Coding Theorems of Information Theory
inferredcites →https://doi.org/10.1007/978-3-662-01510-0openalex-snapshot
Coding Theorems of Information Theory
inferredcites →https://doi.org/10.1007/bf00281397openalex-snapshot
Simultaneous channels
inferredcites →https://doi.org/10.1016/s0019-9958(63)90101-3openalex-snapshot
On channels without a capacity
inferredcites →https://doi.org/10.1214/aoms/1177706106openalex-snapshot
The Capacity of a Class of Channels

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-62938-0_4openalex-snapshot
Quantum Information Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-26326-2_4openalex-snapshot
Quanteninformationstheorie
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_1openalex-snapshot
Special Channels
inferred← citeshttps://doi.org/10.1007/978-3-319-12523-7_5openalex-snapshot
On $$\lambda $$ -Capacities and Information Stability
inferred← citeshttps://doi.org/10.1007/978-3-642-36899-8_11openalex-snapshot
Arbitrarily Varying and Compound Classical-Quantum Channels and a Note on Quantum Zero-Error Capacities
inferred← citeshttps://doi.org/10.1007/bf00533053openalex-snapshot
Elimination of correlation in random codes for arbitrarily varying channels
inferred← citeshttps://doi.org/10.1007/bfb0079113openalex-snapshot
Probability and Information Theory
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.1063/1.4902930openalex-snapshot
Positivity, discontinuity, finite resources, and nonzero error for arbitrarily varying quantum channels
inferred← citeshttps://doi.org/10.1063/1.5139622openalex-snapshot
Universal superposition codes: Capacity regions of compound quantum broadcast channel with confidential messages
inferred← citeshttps://doi.org/10.1109/ciss48834.2020.1570617403openalex-snapshot
On the ϵ-Capacity of Finite Compound Channels with Applications to the Strong Converse and Second Order Coding Rate
inferred← citeshttps://doi.org/10.1109/isit.2014.6874891openalex-snapshot
Positivity, discontinuity, finite resources, nonzero error for arbitrarily varying quantum channels
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9173949openalex-snapshot
Universal superposition codes: capacity regions of compound quantum broadcast channel with confidential messages
inferred← citeshttps://doi.org/10.1109/isita.2010.5649279openalex-snapshot
On arbitrarily varying bidirectional broadcast channels with constraints on input and states
inferred← citeshttps://doi.org/10.1109/tit.1974.1055241openalex-snapshot
A lower bound on the probability of decoding error for the finite-state channel (Corresp.)
inferred← citeshttps://doi.org/10.1109/tit.1982.1056541openalex-snapshot
In Memorium: Jacob Wolfowitz
inferred← citeshttps://doi.org/10.1109/tit.2014.2326412openalex-snapshot
List Decoding for Arbitrarily Varying Broadcast Channels With Receiver Side Information
inferred← citeshttps://doi.org/10.1109/tit.2025.3565891openalex-snapshot
Uniform Common Randomness Generation Over Arbitrary Point-to-Point Channels
inferred← citeshttps://doi.org/10.3390/e14081357openalex-snapshot
Impact of Interference in Coexisting Wireless Networks with Applications to Arbitrarily Varying Bidirectional Broadcast Channels
inferred← citeshttps://doi.org/10.3390/e22101067openalex-snapshot
Performance Analysis of Identification Codes
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.