New lower bounds for the Shannon capacity of odd cycles
From MaRDI portal
Publication:2364621
DOI10.1007/s10623-016-0194-7zbMath1367.05160arXiv1504.01472OpenAlexW1660708001MaRDI QIDQ2364621
K. Ashik Mathew, Patric R. J. Östergård
Publication date: 21 July 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.01472
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coding theorems (Shannon theory) (94A24)
Related Items (7)
Filling space with hypercubes of two sizes – The pythagorean tiling in higher dimensions ⋮ The zero-error capacity of binary channels with 2-memories ⋮ New lower bound on the Shannon capacity of \(C_7\) from circular graphs ⋮ Independent sets in graphs ⋮ New Lower Bounds for Binary Constant-Dimension Subspace Codes ⋮ A unified construction of semiring-homomorphic graph invariants ⋮ On zero-error codes produced by greedy algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the independence numbers of the cubes of odd cycles
- Classification algorithms for codes and designs
- The sandwich theorem
- On the capacity of digraphs
- Improved lower bound on the Shannon capacity of \(C_7\)
- On the Shannon capacity of triangular graphs
- A note on the Shannon capacity of run-length-limited codes (Corresp.)
- On the Shannon capacity of a graph
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- Randomized graph products, chromatic numbers, and Lovasz j-function
- A limit theorem for the Shannon capacities of odd cycles I
- New Lower Bounds for Binary Constant-Dimension Subspace Codes
- Zero-error information theory
- Repeated communication and Ramsey graphs
- Heuristic Algorithms for Constructing Binary Constant Weight Codes
- On the groups of repeated graphs
This page was built for publication: New lower bounds for the Shannon capacity of odd cycles
