Forbiddance and capacity
From MaRDI portal
Publication:659716
DOI10.1007/S00373-010-0987-9zbMATH Open1277.05145OpenAlexW2059541795MaRDI QIDQ659716FDOQ659716
Authors: 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
Recommendations
- scientific article; zbMATH DE number 826055
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle
- Bounds and constructions for ternary constant-composition codes
- On the Complexity of Computing the Capacity of Codes That Avoid Forbidden Difference Patterns
- scientific article; zbMATH DE number 493103
Permutations, words, matrices (05A05) Measures of information, entropy (94A17) Structural characterization of families of graphs (05C75) Extremal set theory (05D05)
Cites Work
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- On the Shannon capacity of a graph
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Zero-error information theory
- Intersecting families of permutations
- Capacities: From information theory to extremal set theory
- Sperner capacities
- Title not available (Why is that?)
- Permutation capacities of families of oriented infinite paths
- On the Shannon capacity of probabilistic graphs
- On reverse-free codes and permutations
- A Sperner-type theorem and qualitative independence
- 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
- The Sperner capacity of linear and nonlinear codes for the cyclic triangle
Cited In (1)
This page was built for publication: Forbiddance and capacity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659716)
