Contributions to the geometry of Hamming spaces

DOI10.1016/0012-365X(77)90017-6zbMath0368.05001OpenAlexW2034968281MaRDI QIDQ1242920

Rudolf Ahlswede, Gyula O. H. Katona

Publication date: 1977

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(77)90017-6

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Analytic and descriptive geometry (51N99)

Related Items

An axiomatic system for affine spaces in terms of points, lines, and planes, Probabilities for Intersecting Systems and Random Subsets of Finite Sets, Intersection theorems under dimension constraints, Application of hypergraph Hoffman's bound to intersecting families, Some intersection theorems on two-valued functions, Monotonicity of fitness landscapes and mutation rate control, Models of multi-user write-efficient memories and general diametric theorems, Some intersection theorems for ordered sets and graphs, A generalization of the Katona theorem for cross t-intersecting families, Coding for write-efficient memory, Shadows and isoperimetry under the sequence-subsequence relation, On Chvàtal's conjecture and a conjecture on families of signed sets, Minimizing the weight of ideals in a layer of the Boolean cube, STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES, r$r$‐Cross t$t$‐intersecting families via necessary intersection points, The maximum measure of non-trivial 3-wise intersecting families, High dimensional Hoffman bound and applications in extremal combinatorics, Extremal problems under dimension constraints., A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances, A Note on Large H-Intersecting Families, On the minimum average distance of binary constant weight codes, Erdős-Ko-Rado theorems for permutations and set partitions, The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture, Diametric theorems in sequence spaces, On diagnosability of large multiprocessor networks, On cross-intersecting families, On the variance of average distance of subsets in the Hamming space, On the minimum average distance of binary codes: Linear programming approach, Forbidden Intersections, Stability versions of Erdős-Ko-Rado type theorems via isoperimetry, AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES, Lower bounds on the minimum average distance of binary codes, On subsets of the hypercube with prescribed Hamming distances, On the union of intersecting families, The diametric theorem in Hamming spaces---optimal anticodes, An ``average distance inequality for large subsets of the cube, Numerical characterization of \(n\)-cube subset partitioning, On the average Hamming distance for binary codes, Note on an extremal problem arising for unreliable networks in parallel computing, A two-family extremal problem in Hamming space, On an equivalence in discrete extremal problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal problems for finite sets and convex hulls---a survey
• A simple proof of the Kruskal-Katona theorem
• Maximal sized antichains in partial orders
• Der Brunn-Minkowskische Satz und sein Spiegeltheorem sowie die isoperimetrische Eigenschaft der Kugel in der euklidischen und hyperbolischen Geometrie
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Source coding with side information and a converse for degraded broadcast channels
• Bounds on conditional probabilities with applications in multi-user communication
• Assignment of Numbers to Vertices
• Error Detecting and Error Correcting Codes
• Intersection theorems for systems of finite sets
• On a combinatorial conjecture of Erdös
• Maximally Connected Arrays on the n-Cube
• On a conjecture of milner on k-graphs with non-disjoint edges
• A generalization of a combinatorial theorem of macaulay
• Sets of Lattice Points which Contain a Maximal Number of Edges
• Optimal Assignments of Numbers to Vertices
• Die Brunn‐Minkowskische Ungleichung und ihr Spiegelbild sowie die isoperimetrische Eigenschaft der Kugel in der euklidischen und nichteuklidischen Geometrie. II
• Über einen Satz von Kruskal