On the extremal combinatorics of the hamming space

Journal of Combinatorial Theory, Series A

Volumn 71, Issue 1, 1995, Pages 112-126

  Körner, János ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009785498     PISSN: 00973165     EISSN: 10960899     Source Type: Journal    
DOI: 10.1016/0097-3165(95)90019-5     Document Type: Article

References (56)

1. Explicit construction of exponentially sized families of k-independent sets
2. Simple constructions of almost k-wise independent random variables
3. How robust is the n-cube
4. Zero-error capacities and very different sequences
5. Bounds on the length of disjunctive codes
6. Families of finite sets in which no set is covered by the union of two others
7. Families of finite sets in which no set is covered by the union of r others
8. Combinatorial properties of systems of sets
9. Union-free hypergraphs and probability theory
10. On the size of separating systems and families of perfect hash functions
11. Universal single transition time asynchronous state assignments
12. A density version of the Hales Jewitt theorem
13. Sperner theorems on directed graphs and qualitative independence
14. Sperner capacities
15. Capacities: From information theory to extremal set theory
16. Subcube fault-tolerance in hypercubes
17. Optimal numberings and isoperimetric problems on graphs
18. Non-adaptive hypergeometric group testing
19. Extremal problems for hypergraphs
20. A theorem on finite sets
21. Two applications (for search theory and truth functions) of Sperner type theorems
22. The Hamming sphere has minimum boundary
23. On a problem of graph theory
24. Nonrandom binary superimposed codes
25. Families of k-independent sets
26. Coding of an information source having ambiuous alphabet and the entropy of graphs
27. Fredman-Komlós bounds and information theory
28. Compressing inconsistent data
29. New bounds for perfect hashing via information theory
30. Separating partition systems and locally different sequences
31. A Sperner-type theorem and qualitative independence
32. Trifference
33. The number of simplices in a complex
34. Locality in distributed graph algorithms
35. New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
36. Perfect hashing graph entropy and circuit complexity
37. On the dimension of the Kneser graph
38. On qualitatively independent partitions and related problems
39. Orthogonal partitions and covering of graphs
40. On the maximum number of qualitatively independent partitions
41. k-Propriétés dans des tableaux de n colonnes; cas particulier de la k-surjectivité et de la k-permutivité
42. On the upper bound of the size of the r-cover-free families
43. Vector sets for exhaustive testing of logic circuits
44. n
45. Covering arrays and intersecting codes
46. Ein Satz über Untermengen einer endlichen Menge
47. Locality based graph coloring
48. On sets of integers containing no k elements in arithmetic progression
49. Modular curves, Shimura curves, and Goppa codes better than the Varshamov-Gilbert bound
50. Coloring graphs with locally few colors