Pages that link to "Item:Q1242920"
From MaRDI portal
The following pages link to Contributions to the geometry of Hamming spaces (Q1242920):
Displayed 25 items.
- An ``average distance'' inequality for large subsets of the cube (Q757399) (← links)
- Note on an extremal problem arising for unreliable networks in parallel computing (Q786823) (← links)
- A two-family extremal problem in Hamming space (Q789376) (← links)
- On the minimum average distance of binary constant weight codes (Q932637) (← links)
- Erdős-Ko-Rado theorems for permutations and set partitions (Q941314) (← links)
- Lower bounds on the minimum average distance of binary codes (Q998361) (← links)
- Some intersection theorems on two-valued functions (Q1106236) (← links)
- Some intersection theorems for ordered sets and graphs (Q1109031) (← links)
- A generalization of the Katona theorem for cross t-intersecting families (Q1119578) (← links)
- Coding for write-efficient memory (Q1123626) (← links)
- Diametric theorems in sequence spaces (Q1193528) (← links)
- On cross-intersecting families (Q1201261) (← links)
- The diametric theorem in Hamming spaces---optimal anticodes (Q1271885) (← links)
- On the average Hamming distance for binary codes (Q1281403) (← links)
- On an equivalence in discrete extremal problems (Q1301649) (← links)
- Models of multi-user write-efficient memories and general diametric theorems (Q1363782) (← links)
- Shadows and isoperimetry under the sequence-subsequence relation (Q1382388) (← links)
- Extremal problems under dimension constraints. (Q1417564) (← links)
- On the variance of average distance of subsets in the Hamming space (Q1765526) (← links)
- Intersection theorems under dimension constraints (Q2368655) (← links)
- A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances (Q3540915) (← links)
- Probabilities for Intersecting Systems and Random Subsets of Finite Sets (Q3704664) (← links)
- Forbidden Intersections (Q3751579) (← links)
- On diagnosability of large multiprocessor networks (Q5901447) (← links)
- On the minimum average distance of binary codes: Linear programming approach (Q5939230) (← links)