Graph Capacities and Zero-Error Transmission Over Compound Channels
From MaRDI portal
Publication:3547412
DOI10.1109/TIT.2005.858987zbMATH Open1318.94051OpenAlexW2134182823MaRDI QIDQ3547412FDOQ3547412
Authors: Jayanth Nayak, Kenneth Rose
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2005.858987
Recommendations
- scientific article; zbMATH DE number 493103
- Arbitrarily varying and compound classical-quantum channels and a note on quantum zero-error capacities
- Zero-Error Source–Channel Coding With Side Information
- scientific article; zbMATH DE number 15262
- On zero-error source coding with decoder side information
Cited In (6)
- Zero-Error Source–Channel Coding With Side Information
- On the Characteristic Graph of a Discrete Symmetric Channel
- Title not available (Why is that?)
- Title not available (Why is that?)
- Forbiddance and capacity
- The Edge-Removal Problem’s Connections to the Zero-Error and $\delta$ -Dependence Problems in Network Coding
This page was built for publication: Graph Capacities and Zero-Error Transmission Over Compound Channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547412)