Capacity results for the discrete memoryless network
From MaRDI portal
Publication:4679876
DOI10.1109/TIT.2002.806135zbMATH Open1063.94029OpenAlexW2129885443MaRDI QIDQ4679876FDOQ4679876
Authors: Gerhard Kramer 
Publication date: 31 May 2005
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2002.806135
Recommendations
- Random coding theorems for the general discrete memoryless broadcast channel
- New outer bounds to capacity regions of two-way channels
- A general coding scheme for the two-way channel
- A Converse Result for the Discrete Memoryless Relay Channel With Relay–Transmitter Feedback
- A simple class of capacity-achieving strategies for discrete memoryless channels with feedback
Cited In (8)
- Some Aspects of Information Theory in Gambling and Economics
- Network coding for line networks with broadcast channels
- Quantification of effective connectivity in the brain using a measure of directed information
- Memory Capacity of Balanced Networks
- Random coding theorems for the general discrete memoryless broadcast channel
- Computation of Total Capacity for Discrete Memoryless Multiple-Access Channels
- Analogy between gambling and measurement-based work extraction
- Sum-Networks From Incidence Structures: Construction and Capacity Analysis
This page was built for publication: Capacity results for the discrete memoryless network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4679876)
