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

DOI10.1023/A:1022424630332MaRDI QIDQ686982zbMATH OpenOpenAlexFDO

Authors Robert Calderbank, Peter Frankl, Ron Graham, Wen-Ching Winnie Li, Larry Shepp

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 theorydirected graphsShannon capacitySperner theoremSperner capacity

Mathematics Subject Classification ID

Linear programming (90C05) Directed graphs (digraphs), tournaments (05C20) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• On the Sperner capacity of the cyclic triangle
• On some conjectures about optimal ternary cyclic codes
• On some conjectures about optimal ternary cyclic codes
• Finite maximal codes and triangle conjecture
• Further results on optimal ternary cyclic codes
• Asymptotic bounds for spherical codes
• The Tietäväinen bound for spherical codes
• scientific article; zbMATH DE number 4083543
• On the covering radius of cyclic linear codes and arithmetic codes
• A class of optimal ternary cyclic codes and their duals

Cites work

• scientific article; zbMATH DE number 3668628 (Why is no real title available?)
• scientific article; zbMATH DE number 3700716 (Why is no real title available?)
• scientific article; zbMATH DE number 15262 (Why is no real title available?)
• scientific article; zbMATH DE number 192896 (Why is no real title available?)
• scientific article; zbMATH DE number 857071 (Why is no real title available?)
• A Sperner-type theorem and qualitative independence
• Capacities: From information theory to extremal set theory
• Covering finite fields with cosets of subspaces
• Intersection number and capacities of graphs
• Matrix Analysis
• On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
• On the Shannon capacity of a graph
• On the Sperner capacity of the cyclic triangle
• Qualitative independence and Sperner problems for directed graphs
• Sperner capacities
• The blocking number of an affine space

Cited in

(12)

• Sperner capacity of small digraphs
• Different capacities of a digraph
• Privileged users in zero-error transmission over a noisy channel
• Capacities: From information theory to extremal set theory
• On the product dimension of clique factors
• Sperner codes
• On subsets of the hypercube with prescribed Hamming distances
• Local chromatic number and Sperner capacity
• On the Sperner capacity of the cyclic triangle
• Forbiddance and capacity
• On the capacity of Boolean graph formulæ
• Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions

This page was built for publication: The Sperner capacity of linear and nonlinear codes for the cyclic triangle

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