The Sperner capacity of linear and nonlinear codes for the cyclic triangle

DOI10.1023/A:1022424630332zbMath0778.94004OpenAlexW2148695545MaRDI QIDQ686982

Robert Calderbank, Lawrence A. Shepp, Ronald L. Graham, Peter Frankl, Wen-Ch'ing Winnie Li

Publication date: 13 October 1993

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022424630332

zbMATH Keywords

information theorySperner capacitydirected graphsShannon capacitySperner theorem

Mathematics Subject Classification ID

Linear programming (90C05) 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, Capacities: From information theory to extremal set theory, Forbiddance and capacity, On the product dimension of clique factors, On the Sperner capacity of the cyclic triangle, Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions, On the capacity of Boolean graph formulæ, On subsets of the hypercube with prescribed Hamming distances, Local chromatic number and Sperner capacity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Sperner capacity of the cyclic triangle
• A Sperner-type theorem and qualitative independence
• Qualitative independence and Sperner problems for directed graphs
• Covering finite fields with cosets of subspaces
• The blocking number of an affine space
• Capacities: From information theory to extremal set theory
• Intersection number and capacities of graphs
• Sperner capacities
• Matrix Analysis
• On the Shannon capacity of a graph
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph