Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Publication:3977587

From MaRDI portal
Jump to:navigation, search


zbMath0741.05002MaRDI QIDQ3977587

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

Publication date: 25 June 1992


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

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



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3977587&oldid=12011479"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 00:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki