On the extremal combinatorics of the Hamming space

DOI10.1016/0097-3165(95)90019-5MaRDI QIDQ1894014zbMATH OpenOpenAlexFDO

Authors János Körner

Publication date 26 November 1995

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0097-3165(95)90019-5

zbMATH Keywords

extremal combinatoricstriangle inequalityHamming spacegeneral positionextremal set theoryqualitative independence(1,2)-separation

Mathematics Subject Classification ID

Extremal set theory (05D05)

Recommendations

• On metric dimension of nonbinary Hamming spaces
• scientific article; zbMATH DE number 2170402
• scientific article; zbMATH DE number 431468
• Tight packings of Hamming spheres
• The edge-diametric theorem in Hamming spaces

Cites work

• scientific article; zbMATH DE number 4043100 (Why is no real title available?)
• scientific article; zbMATH DE number 3747196 (Why is no real title available?)
• scientific article; zbMATH DE number 15262 (Why is no real title available?)
• scientific article; zbMATH DE number 3467166 (Why is no real title available?)
• scientific article; zbMATH DE number 3468645 (Why is no real title available?)
• scientific article; zbMATH DE number 3570458 (Why is no real title available?)
• scientific article; zbMATH DE number 3801449 (Why is no real title available?)
• scientific article; zbMATH DE number 881164 (Why is no real title available?)
• scientific article; zbMATH DE number 5171518 (Why is no real title available?)
• scientific article; zbMATH DE number 3238444 (Why is no real title available?)
• scientific article; zbMATH DE number 3189757 (Why is no real title available?)
• A Sperner-type theorem and qualitative independence
• A density version of the Hales-Jewett theorem
• Capacities: From information theory to extremal set theory
• Coloring graphs with locally few colors
• Combinatorial properties of systems of sets
• Compressing inconsistent data
• Covering arrays and intersecting codes
• Extremal problems for finite sets and convex hulls---a survey
• Families of \(k\)-independent sets
• Families of finite sets in which no set is covered by the union of \(r\) others
• Families of finite sets in which no set is covered by the union of two others
• Fredman–Komlós bounds and information theory
• How robust is the n-cube?
• Intersection number and capacities of graphs
• Locality based graph coloring
• Locality in Distributed Graph Algorithms
• Modular curves, Shimura curves, and Goppa codes, better than Varshamov-Gilbert bound
• New bounds for perfect hashing via information theory
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Nonrandom binary superimposed codes
• On qualitatively independent partitions and related problems
• On restricted colourings of \(K_ n\)
• On sets of integers containing k elements in arithmetic progression
• On the maximum number of qualitative independent partitions
• On the upper bound of the size of the \(r\)-cover-free families
• Optimal numberings and isoperimetric problems on graphs
• Orthogonal partitions and covering of graphs
• Qualitative independence and Sperner problems for directed graphs
• Separating Partition Systems and Locally Different Sequences
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Sperner capacities
• Subcube fault-tolerance in hypercubes
• Two applications (for search theory and truth functions) of Sperner type theorems
• Union-free hypergraphs and probability theory
• Vector sets for exhaustive testing of logic circuits

Cited in

(37)

• Domination mappings into the Hamming ball: existence, constructions, and algorithms
• Too acute to be true: the story of acute sets
• The general position number of integer lattices
• The general position avoidance game and hardness of general position games
• The diagonal limits of Hamming spaces
• Combinatorial PDEs on Hamming graphs
• The general position achievement game played on graphs
• 2-cancellative hypergraphs and codes
• On general position sets in Cartesian products
• A geometric proof of the gap theorem
• Separation and Witnesses
• General position sets in two families of Cartesian product graphs
• TRAVERSING A GRAPH IN GENERAL POSITION
• Total mutual-visibility in graphs with emphasis on lexicographic and Cartesian products
• scientific article; zbMATH DE number 2170402 (Why is no real title available?)
• Codes for copyright protection: the case of two pirates
• The general position number of the Cartesian product of two trees
• On monophonic position sets in graphs
• On metric dimension of nonbinary Hamming spaces
• Edge general position sets in Fibonacci and Lucas cubes
• On the Weight of Halfspaces over Hamming Balls
• A Steiner general position problem in graph theory
• On Rosenbloom and Tsfasman's generalization of the Hamming space
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• A Bound on Equitable Partitions of the Hamming Space
• Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces
• Near-sunflowers and focal families
• On one extremal property of Hamming halfspaces
• scientific article; zbMATH DE number 4023309 (Why is no real title available?)
• \((2,1)\)-separating systems beyond the probabilistic bound
• Generalization of IPP codes and IPP set systems
• Extremal edge general position sets in some graphs
• General \(d\)-position sets
• Delta-systems and qualitative (in)dependence
• Tiling Hamming space with few spheres
• Variety of general position problems in graphs
• The edge general position problem

This page was built for publication: On the extremal combinatorics of the Hamming space

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