scientific article

zbMath0741.05002MaRDI QIDQ3977587

János Körner, Gábor Simonyi, Gérard D. Cohen

Publication date: 25 June 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polyhedral combinatoricsmemoryless channelszero-error capacity

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Graph theory (05C99) Channel models (including quantum) in information and communication theory (94A40)

Related Items (12)

Sperner capacities ⋮ Capacities: From information theory to extremal set theory ⋮ On the extremal combinatorics of the Hamming space ⋮ Forbiddance and capacity ⋮ Connector families of graphs ⋮ A Sperner-type theorem and qualitative independence ⋮ The Sperner capacity of linear and nonlinear codes for the cyclic triangle ⋮ Qualitative independence and Sperner problems for directed graphs ⋮ Cross‐intersecting couples of graphs ⋮ On the capacity of Boolean graph formulæ ⋮ Connection between conjunctive capacity and structural properties of graphs ⋮ Capacities of graphs and \(2\)-matchings

This page was built for publication: