The zero-error capacity of binary channels with 2-memories
From MaRDI portal
Publication:6089460
DOI10.3934/AMC.2022009zbMATH Open1529.94019OpenAlexW4225933742MaRDI QIDQ6089460FDOQ6089460
Authors:
Publication date: 14 December 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2022009
Recommendations
Applications of graph theory (05C90) Coding theorems (Shannon theory) (94A24) Extremal problems in graph theory (05C35) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- On the Shannon capacity of a graph
- Improved lower bound on the Shannon capacity of \(C_7\)
- Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs
- The Shannon capacity of a union
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- A nontrivial lower bound on the shannon capacities of the complements of odd cycles
- New lower bounds for the Shannon capacity of odd cycles
- The Shannon capacity of a graph and the independence numbers of its powers
- New lower bound on the Shannon capacity of \(C_7\) from circular graphs
- A bound on the Shannon capacity via a linear programming variation
- On the normalized 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
- On Zero-Error Capacity of Binary Channels With One Memory
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)
