The Sperner capacity of linear and nonlinear codes for the cyclic triangle
DOI10.1023/A:1022424630332zbMATH Open0778.94004OpenAlexW2148695545MaRDI QIDQ686982FDOQ686982
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
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
Linear programming (90C05) Directed graphs (digraphs), tournaments (05C20) Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)
Cites Work
- Matrix Analysis
- On the Shannon capacity of a graph
- Title not available (Why is that?)
- Covering finite fields with cosets of subspaces
- The blocking number of an affine space
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Some Problems of Lovász Concerning the Shannon Capacity of a Graph
- Capacities: From information theory to extremal set theory
- Sperner capacities
- Title not available (Why is that?)
- A Sperner-type theorem and qualitative independence
- Qualitative independence and Sperner problems for directed graphs
- Intersection number and capacities of graphs
- Title not available (Why is that?)
- On the Sperner capacity of the cyclic triangle
Cited In (12)
- On the product dimension of clique factors
- On the Sperner capacity of the cyclic triangle
- Sperner codes
- Privileged users in zero-error transmission over a noisy channel
- Sperner capacity of small digraphs
- Different capacities of a digraph
- Local chromatic number and Sperner capacity
- On subsets of the hypercube with prescribed Hamming distances
- Forbiddance and capacity
- Capacities: From information theory to extremal set theory
- 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)
