Capacities: From information theory to extremal set theory

DOI10.1016/0097-3165(94)90108-2zbMath0807.94008OpenAlexW1998992478MaRDI QIDQ1337171

Luisa Gargano, János Körner, Ugo Vaccaro

Publication date: 5 March 1995

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90108-2

zbMATH Keywords

extremal set theoryinformation transmissionzero-error capacity

Mathematics Subject Classification ID

Extremal set theory (05D05) Directed graphs (digraphs), tournaments (05C20) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)

Related Items

Different capacities of a digraph, On the extremal combinatorics of the Hamming space, Intersection number and capacities of graphs, Binary covering arrays on tournaments, Rainbow Saturation and Graph Capacities, Local boxicity and maximum degree, Locating and detecting arrays for interaction faults, Algorithms for \(q\)-ary error-correcting codes with limited magnitude and feedback, Forbiddance and capacity, Connector families of graphs, Unnamed Item, The Sperner capacity of linear and nonlinear codes for the cyclic triangle, Unnamed Item, Interlocked Permutations, Delta-systems and qualitative (in)dependence, Graph-intersecting set systems and LYM inequalities, On the capacity of Boolean graph formulæ, Connection between conjunctive capacity and structural properties of graphs, A graph-theoretic generalization of the Sauer-Shelah lemma, Divergent permutations, Merging covering arrays and compressing multiple sequence alignments, Local chromatic number and Sperner capacity, Capacities of graphs and \(2\)-matchings, Relations between the Local Chromatic Number and Its Directed Version

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Sperner capacity of linear and nonlinear codes for the cyclic triangle
• On the maximum number of qualitative independent partitions
• Simultaneous channels
• A Sperner-type theorem and qualitative independence
• Qualitative independence and Sperner problems for directed graphs
• On the ratio of optimal integral and fractional covers
• Sperner capacities
• The Capacity of a Class of Channels
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• A comparison of the Delsarte and Lovász bounds
• On the capacity of the arbitrarily varying channel for maximum probability of error
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• On the Shannon capacity of a graph
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
• On generalized graphs