On the Sperner capacity of the cyclic triangle
From MaRDI portal
Publication:686968
DOI10.1023/A:1022455407000zbMath0778.94003OpenAlexW1493858165MaRDI QIDQ686968
Publication date: 13 October 1993
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1022455407000
Linear programming (90C05) Directed graphs (digraphs), tournaments (05C20) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items (6)
Different capacities of a digraph ⋮ The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Unnamed Item ⋮ The Sperner capacity of linear and nonlinear codes for the cyclic triangle ⋮ Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions ⋮ Local chromatic number and Sperner capacity
Cites Work
This page was built for publication: On the Sperner capacity of the cyclic triangle
