The zero-error capacity of binary channels with 2-memories
From MaRDI portal
Publication:6089460
Recommendations
Cites work
- A bound on the Shannon capacity via a linear programming variation
- A nontrivial lower bound on the shannon capacities of the complements of odd cycles
- Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs
- Improved lower bound on the Shannon capacity of \(C_7\)
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs
- New lower bounds for the Shannon capacity of odd cycles
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- On Zero-Error Capacity of Binary Channels With One Memory
- On the Shannon capacity of a graph
- On the normalized Shannon capacity of a union
- The Shannon capacity of a graph and the independence numbers of its powers
- The Shannon capacity of a union
- Zero-Error Capacity of Binary Channels With Memory
- Zero-error capacity for models with memory and the enlightened dictator channel
This page was built for publication: The zero-error capacity of binary channels with 2-memories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6089460)