The zero-error capacity of binary channels with 2-memories

DOI10.3934/amc.2022009zbMath1529.94019OpenAlexW4225933742MaRDI QIDQ6089460

No author found.

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

zbMATH Keywords

graphzero-error capacitybinary channelschannels with memories

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Applications of graph theory (05C90) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Cites Work

• The Shannon capacity of a union
• New lower bound on the Shannon capacity of \(C_7\) from circular graphs
• Improved lower bound on the Shannon capacity of \(C_7\)
• New lower bounds for the Shannon capacity of odd cycles
• Zero-Error Capacity of Binary Channels With Memory
• The Shannon capacity of a graph and the independence numbers of its powers
• On the Shannon capacity of a graph
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
• Zero-error capacity for models with memory and the enlightened dictator channel
• 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
• On Zero-Error Capacity of Binary Channels With One Memory
• Bounds on Shannon Capacity and Ramsey Numbers From Product of Graphs
• On the Normalized Shannon Capacity of a Union

This page was built for publication: The zero-error capacity of binary channels with 2-memories