On the public citation graph
Simultaneous channels
0 signed · 137 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.1016/s0019-9958(59)90066-xopenalex-snapshot
On the coding theorem and its converse for finite-memory channels
inferredcites →https://doi.org/10.1147/rd.24.0289openalex-snapshot
Channels with Side Information at the Transmitter
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
inferredcites →https://doi.org/10.1215/ijm/1255454549openalex-snapshot
The maximum achievable length of an error correcting code
inferredcites →https://doi.org/10.1215/ijm/1255455455openalex-snapshot
Strong converse of the coding theorem for semicontinuous 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/978-3-030-65072-8_27openalex-snapshot
New Results in Identification Theory
inferred← citeshttps://doi.org/10.1007/978-3-031-09745-4_13openalex-snapshot
Over-the-Air Computation for Distributed Machine Learning and Consensus in Large Wireless Networks
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-319-23609-4_5openalex-snapshot
Broadcast Channels with Confidential Messages: Channel Uncertainty, Robustness, and Continuity
inferred← citeshttps://doi.org/10.1007/bf00533053openalex-snapshot
Elimination of correlation in random codes for arbitrarily varying channels
inferred← citeshttps://doi.org/10.1007/bf00538386openalex-snapshot
The weak capacity of averaged channels
inferred← citeshttps://doi.org/10.1007/bf00572920openalex-snapshot
Beitr�ge zur Shannonschen Informationstheorie im Falle nichtstation�rer Kan�le
inferred← citeshttps://doi.org/10.1007/bfb0079115openalex-snapshot
The structure of capacity functions for compound channels
inferred← citeshttps://doi.org/10.1007/s00220-009-0887-0openalex-snapshot
Entanglement Transmission and Generation under Channel Uncertainty: Universal Quantum Channel Coding
inferred← citeshttps://doi.org/10.1016/0097-3165(94)90108-2openalex-snapshot
Capacities: From information theory to extremal set theory
inferred← citeshttps://doi.org/10.1016/b978-0-12-198450-2.50011-7openalex-snapshot
REFERENCES**The list of references was closed in May 1979. Items added in proof are marked by asterisk.
inferred← citeshttps://doi.org/10.1016/s0019-9958(60)90317-xopenalex-snapshot
A note on the strong converse of the coding theorem for the general discrete finite-memory channel
inferred← citeshttps://doi.org/10.1016/s0019-9958(61)80005-3openalex-snapshot
Some remarks on the capacity of compound channels in the semicontinuous case
inferred← citeshttps://doi.org/10.1016/s0019-9958(69)90157-0openalex-snapshot
Correlated decoding for channels with arbitrarily varying channel probability functions
inferred← citeshttps://doi.org/10.1016/s0019-9958(71)90775-3openalex-snapshot
Bounds on algebraic code capacities for noisy channels. I
inferred← citeshttps://doi.org/10.1016/s0019-9958(71)90783-2openalex-snapshot
Bounds on algebraic code capacities for noisy channels. II
inferred← citeshttps://doi.org/10.1017/9781316450840.011openalex-snapshot
The Discrete Memoryless Arbitrarily Varying Wiretap Channel
inferred← citeshttps://doi.org/10.1017/9781316450840.012openalex-snapshot
Super-Activation as a Unique Feature of Secure Communication over Arbitrarily Varying Channels
inferred← citeshttps://doi.org/10.1017/s0001867800038003openalex-snapshot
Channels without synchronization
inferred← citeshttps://doi.org/10.1017/s0021900200096017openalex-snapshot
Channel capacities for list codes
inferred← citeshttps://doi.org/10.1017/s002190020011397xopenalex-snapshot
Recent results in information theory
inferred← citeshttps://doi.org/10.1063/1.3521499openalex-snapshot
Universal coding for transmission of private information
inferred← citeshttps://doi.org/10.1103/physreva.78.042331openalex-snapshot
Quantum capacity of a class of compound channels
inferred← citeshttps://doi.org/10.1103/revmodphys.86.1203openalex-snapshot
Quantum channels and memory effects
inferred← citeshttps://doi.org/10.1109/18.720535openalex-snapshot
Reliable communication under channel uncertainty
inferred← citeshttps://doi.org/10.1109/9780470544907.ch2openalex-snapshot
Fifty Years of Shannon Theory
inferred← citeshttps://doi.org/10.1109/acssc.2014.7094397openalex-snapshot
Robust transmission over wiretap channels with secret keys
inferred← citeshttps://doi.org/10.1109/allerton.2008.4797651openalex-snapshot
Compound Gaussian multiple access channels with noisy feedback
inferred← citeshttps://doi.org/10.1109/ciss.2010.5464950openalex-snapshot
Opportunistic capacity and error exponent regions for variable length communication over compound channel with feedback
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/cns.2014.6997474openalex-snapshot
On secure communication over multiple access wiretap channels under channel uncertainty
inferred← citeshttps://doi.org/10.1109/glocomw.2016.7848839openalex-snapshot
Arbitrarily Varying Wiretap Channels With Type Constrained States
inferred← citeshttps://doi.org/10.1109/icassp.2014.6854347openalex-snapshot
Strong secrecy and decoding performance analysis for robust broadcasting under channel uncertainty
inferred← citeshttps://doi.org/10.1109/icassp40776.2020.9054467openalex-snapshot
Robust Transmission Over Channels with Channel Uncertainty: an Algorithmic Perspective
inferred← citeshttps://doi.org/10.1109/icc.2009.5199250openalex-snapshot
On the Capacity of Bidirectional Broadcast Channels under Channel Uncertainty
inferred← citeshttps://doi.org/10.1109/icc.2013.6655075openalex-snapshot
On the strong secrecy capacity of wiretap channels with side information
inferred← citeshttps://doi.org/10.1109/icc42927.2021.9500750openalex-snapshot
Turing Meets Shannon: Algorithmic Constructability of Capacity-Achieving Codes
inferred← citeshttps://doi.org/10.1109/isccsp.2012.6217861openalex-snapshot
Selective Coding Strategy for composite relay channels
inferred← citeshttps://doi.org/10.1109/isit.2007.4557258openalex-snapshot
On the Compound Finite State Channel with Feedback
inferred← citeshttps://doi.org/10.1109/isit.2008.4594953openalex-snapshot
Classical capacity of averaged quantum channels
inferred← citeshttps://doi.org/10.1109/isit.2010.5513234openalex-snapshot
Opportunistic capacity and error exponent regions for compound channel with feedback
inferred← citeshttps://doi.org/10.1109/isit.2010.5513324openalex-snapshot
The arbitrarily varying channel when the jammer knows the channel input
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.2012.6283072openalex-snapshot
Selective coding strategy for unicast composite networks
inferred← citeshttps://doi.org/10.1109/isit.2012.6284002openalex-snapshot
Transmission over arbitrarily permuted parallel Gaussian channels
inferred← citeshttps://doi.org/10.1109/isit.2012.6284663openalex-snapshot
Strong secrecy in compound broadcast channels with confidential messages
inferred← citeshttps://doi.org/10.1109/isit.2015.7282508openalex-snapshot
A General Formula for Compound Channel Capacity
inferred← citeshttps://doi.org/10.1109/isit.2017.8006625openalex-snapshot
On the compound MIMO wiretap channel with mean feedback
inferred← citeshttps://doi.org/10.1109/isit.2017.8006787openalex-snapshot
Robust and secure identification
inferred← citeshttps://doi.org/10.1109/isit.2018.8437775openalex-snapshot
A Hypothesis Testing Approach for Communication Over Entanglement Assisted Compound Quantum Channel
inferred← citeshttps://doi.org/10.1109/isit44484.2020.9174342openalex-snapshot
On the Algorithmic Computability of Achievability and Converse: ϵ-Capacity of Compound Channels and Asymptotic Bounds of Error-Correcting Codes
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517776openalex-snapshot
Compound Arbitrarily Varying Channels
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517859openalex-snapshot
Universal classical-quantum multiple access channel coding
inferred← citeshttps://doi.org/10.1109/isit45174.2021.9517985openalex-snapshot
Towards Secure Over-The-Air Computation
inferred← citeshttps://doi.org/10.1109/isit50566.2022.9834558openalex-snapshot
Byzantine Consensus Over Broadcast Channels
inferred← citeshttps://doi.org/10.1109/isit54713.2023.10206801openalex-snapshot
Competitive Channel-Capacity
inferred← citeshttps://doi.org/10.1109/ita.2008.4601093openalex-snapshot
Orthogonal codes for robust low-cost communication
inferred← citeshttps://doi.org/10.1109/ita.2014.6804214openalex-snapshot
Burst or random error correction based on fire and BCH codes
inferred← citeshttps://doi.org/10.1109/itw.2008.4578689openalex-snapshot
Classical capacities of compound quantum channels
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.2013.6691235openalex-snapshot
The secrecy capacity of a compound MIMO Gaussian channel
inferred← citeshttps://doi.org/10.1109/itw48936.2021.9611468openalex-snapshot
Adaptive Interference Coordination over Channels with Unknown State at the Encoder and the Decoder
inferred← citeshttps://doi.org/10.1109/itw61385.2024.10806963openalex-snapshot
One-Shot Information Hiding
inferred← citeshttps://doi.org/10.1109/itw62417.2025.11240340openalex-snapshot
Dynamical Linear Reward Systems under Competitive Horizon Criteria
inferred← citeshttps://doi.org/10.1109/jproc.2015.2459652openalex-snapshot
Secure Communication Under Channel Uncertainty and Adversarial Attacks
inferred← citeshttps://doi.org/10.1109/jsac.2016.2603660openalex-snapshot
On the Capacity of the Beta-Binomial Channel Model for Multi-Level Cell Flash Memories
inferred← citeshttps://doi.org/10.1109/jsait.2021.3062755openalex-snapshot
An Overview of Information-Theoretic Security and Privacy: Metrics, Limits and Applications
inferred← citeshttps://doi.org/10.1109/lcomm.2011.051011.110152openalex-snapshot
An Algorithm for Computing Maximin of Mutual Informations
inferred← citeshttps://doi.org/10.1109/lcomm.2018.2889330openalex-snapshot
Robust Multi-Layer Coding in the Presence of Channel Distribution Uncertainty
inferred← citeshttps://doi.org/10.1109/msp.2013.2271190openalex-snapshot
Physical Layer Service Integration in Wireless Networks : Signal processing challenges
inferred← citeshttps://doi.org/10.1109/spawc.2018.8445932openalex-snapshot
Secure Identification Under Jamming Attacks
inferred← citeshttps://doi.org/10.1109/tcomm.2010.05.090156openalex-snapshot
On the robustness of dirty paper coding
inferred← citeshttps://doi.org/10.1109/tcomm.2010.082010.090170openalex-snapshot
Optimal Coding Strategies for Bidirectional Broadcast Channels Under Channel Uncertainty
inferred← citeshttps://doi.org/10.1109/tifs.2013.2271424openalex-snapshot
Wiretap Channels With Side Information—Strong Secrecy Capacity and Optimal Transceiver Design
inferred← citeshttps://doi.org/10.1109/tifs.2014.2348193openalex-snapshot
Robust Broadcasting of Common and Confidential Messages Over Compound Channels: Strong Secrecy and Decoding Performance
inferred← citeshttps://doi.org/10.1109/tifs.2015.2465937openalex-snapshot
On the Continuity of the Secrecy Capacity of Compound and Arbitrarily Varying Wiretap Channels
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/tifs.2018.2854729openalex-snapshot
Secure Identification Under Passive Eavesdroppers and Active Jamming Attacks
inferred← citeshttps://doi.org/10.1109/tifs.2019.2932226openalex-snapshot
Secure Communication and Identification Systems — Effective Performance Evaluation on Turing Machines
inferred← citeshttps://doi.org/10.1109/tit.1963.1057866openalex-snapshot
Foundations of information theory
inferred← citeshttps://doi.org/10.1109/tit.1963.1057867openalex-snapshot
Report on progress in information theory in the U.S.A. 1960-1963
inferred← citeshttps://doi.org/10.1109/tit.1982.1056541openalex-snapshot
In Memorium: Jacob Wolfowitz
inferred← citeshttps://doi.org/10.1109/tit.2005.853322openalex-snapshot
Capacity Analysis for Continuous-Alphabet Channels With Side Information, Part I: A General Framework
inferred← citeshttps://doi.org/10.1109/tit.2005.858987openalex-snapshot
Graph Capacities and Zero-Error Transmission Over Compound Channels
inferred← citeshttps://doi.org/10.1109/tit.2007.911158openalex-snapshot
Broadcast Capacity Region of Two-Phase Bidirectional Relaying
inferred← citeshttps://doi.org/10.1109/tit.2008.2006463openalex-snapshot
Orthogonal Codes for Robust Low-Cost Communication
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.2009.2023727openalex-snapshot
Feedback Capacity of the Compound Channel
inferred← citeshttps://doi.org/10.1109/tit.2009.2025574openalex-snapshot
Outage Behavior of Discrete Memoryless Channels Under Channel Estimation Errors
inferred← citeshttps://doi.org/10.1109/tit.2010.2080910openalex-snapshot
Linear Universal Decoding for Compound Channels
inferred← citeshttps://doi.org/10.1109/tit.2011.2178153openalex-snapshot
List-Decoding for the Arbitrarily Varying Channel Under State Constraints
inferred← citeshttps://doi.org/10.1109/tit.2012.2191689openalex-snapshot
Opportunistic Capacity and Error Exponent Region for the Compound Channel With Feedback
inferred← citeshttps://doi.org/10.1109/tit.2012.2226699openalex-snapshot
Cooperative Strategies for Simultaneous and Broadcast Relay Channels
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.2014.2368564openalex-snapshot
Mixed Noisy Network Coding and Cooperative Unicasting in Wireless Networks
inferred← citeshttps://doi.org/10.1109/tit.2014.2379273openalex-snapshot
Multiparty Zero-Error Classical Channel Coding With Entanglement
inferred← citeshttps://doi.org/10.1109/tit.2015.2409836openalex-snapshot
Joint Unitary Triangularization for Gaussian Multi-User MIMO Networks
inferred← citeshttps://doi.org/10.1109/tit.2015.2458856openalex-snapshot
The Secrecy Capacity of Compound Gaussian MIMO Wiretap Channels
inferred← citeshttps://doi.org/10.1109/tit.2015.2513041openalex-snapshot
Decode-and-Forward Relaying via Standard AWGN Coding and Decoding
inferred← citeshttps://doi.org/10.1109/tit.2017.2672981openalex-snapshot
Entanglement-assisted capacities of compound quantum channels
inferred← citeshttps://doi.org/10.1109/tit.2018.2821674openalex-snapshot
Computing the Channel Capacity of a Communication System Affected by Uncertain Transition Probabilities
inferred← citeshttps://doi.org/10.1109/tit.2018.2876280openalex-snapshot
A Hypothesis Testing Approach for Communication Over Entanglement-Assisted Compound Quantum Channel
inferred← citeshttps://doi.org/10.1109/tit.2021.3058842openalex-snapshot
A Unified Framework for One-Shot Achievability via the Poisson Matching Lemma
inferred← citeshttps://doi.org/10.1109/tit.2021.3096646openalex-snapshot
State Masking Over a Two-State Compound Channel
inferred← citeshttps://doi.org/10.1109/tit.2021.3131575openalex-snapshot
Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding
inferred← citeshttps://doi.org/10.1109/tit.2023.3259580openalex-snapshot
Identification Over Compound Multiple-Input Multiple-Output Broadcast Channels
inferred← citeshttps://doi.org/10.1109/tit.2024.3394149openalex-snapshot
Competitive Channel-Capacity
inferred← citeshttps://doi.org/10.1109/tit.2024.3397888openalex-snapshot
Relay Channels With Unreliable Helpers
inferred← citeshttps://doi.org/10.1109/tit.2025.3538870openalex-snapshot
Universal Tester for Multiple Independence Testing and Classical-Quantum Arbitrarily Varying Multiple Access Channel
inferred← citeshttps://doi.org/10.1109/tit.2025.3649987openalex-snapshot
Consensus Capacity of Noisy Broadcast Channels
inferred← citeshttps://doi.org/10.1109/tsp.2011.2171684openalex-snapshot
Joint Unitary Triangularization for MIMO Networks
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.1109/wifs.2015.7368560openalex-snapshot
Robust PUF based authentication
inferred← citeshttps://doi.org/10.1109/wifs.2018.8630789openalex-snapshot
Performance Evaluation of Secure Communication Systems on Turing Machines
inferred← citeshttps://doi.org/10.1109/wifs47025.2019.9035108openalex-snapshot
Resource Allocation for Secure Communication Systems: Algorithmic Solvability
inferred← citeshttps://doi.org/10.1109/wsa.2012.6181236openalex-snapshot
Robust transmit strategies for multiantenna bidirectional broadcast channels
inferred← citeshttps://doi.org/10.1134/s1054661824010073openalex-snapshot
Outer Bound for E-Capacity–Equivocation Region of Compound Wiretap Channel
inferred← citeshttps://doi.org/10.1561/9781601980472openalex-snapshot
Reliability Criteria in Information Theory and in Statistical Hypothesis Testing
inferred← citeshttps://doi.org/10.24200/sci.2017.4375openalex-snapshot
Shannon Entropy And Tracking Dynamic Systems Over Noisy Channels
inferred← citeshttps://doi.org/10.2996/kmj/1138845016openalex-snapshot
Coding theorems for the compound semi-continuous memoryless channels
inferred← citeshttps://doi.org/10.3390/e19090480openalex-snapshot
Robust Biometric Authentication from an Information Theoretic Perspective
inferred← citeshttps://doi.org/10.3929/ethz-a-010645373openalex-snapshot
Strong converse for general compound channels
inferred← citeshttps://doi.org/10.3934/amc.2016009openalex-snapshot
Arbitrarily varying multiple access channels with conferencing encoders: List decoding and finite coordination resources
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.1701.01530openalex-snapshot
On the Reliability Function of the Common-Message Broadcast Channel with Variable-Length Feedback
inferred← citeshttps://doi.org/10.48550/arxiv.1906.06675openalex-snapshot
Covert Communication Over a Compound Channel
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.