scientific article; zbMATH DE number 15262

MaRDI QIDQ3977587zbMATHFDO

Authors János Körner, Gábor Simonyi, Gérard 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)

Recommendations

• scientific article; zbMATH DE number 493103
• Zero-error information theory
• Graph Capacities and Zero-Error Transmission Over Compound Channels
• Capacities: From information theory to extremal set theory
• Zero-error list capacities of discrete memoryless channels

Cited in

(15)

• Combinatorial methods and models. Rudolf Ahlswede's lectures on information theory 4. Edited by Alexander Ahlswede, Ingo Althöfer, Christian Deppe and Ulrich Tamm
• A Sperner-type theorem and qualitative independence
• Capacities: From information theory to extremal set theory
• Qualitative independence and Sperner problems for directed graphs
• Connection between conjunctive capacity and structural properties of graphs
• On the extremal combinatorics of the Hamming space
• Connector families of graphs
• Capacities of graphs and \(2\)-matchings
• Forbiddance and capacity
• On the capacity of Boolean graph formulæ
• Graph Capacities and Zero-Error Transmission Over Compound Channels
• Sperner capacities
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle
• Cross‐intersecting couples of graphs
• scientific article; zbMATH DE number 493103 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977587)