Forbiddance and capacity

DOI10.1007/s00373-010-0987-9zbMath1277.05145MaRDI QIDQ659716

Emanuela Fachini, János Körner

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0987-9

zbMATH Keywords

Information theory; Graph capacity; Graph families; Intersection theorems

Mathematics Subject Classification ID

05A05: Permutations, words, matrices

05D05: Extremal set theory

05C75: Structural characterization of families of graphs

94A17: Measures of information, entropy

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle
• A Sperner-type theorem and qualitative independence
• On the Shannon capacity of probabilistic graphs
• Capacities: From information theory to extremal set theory
• Sperner capacities
• On Reverse-Free Codes and Permutations
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Graph Capacities and Zero-Error Transmission Over Compound Channels
• On Witsenhausen's zero-error rate for multiple sources
• On the capacity of the arbitrarily varying channel for maximum probability of error
• On the Shannon capacity of a graph
• Zero-error information theory
• Permutation Capacities of Families of Oriented Infinite Paths
• Intersecting families of permutations