Pages that link to "Item:Q1242920"
From MaRDI portal
The following pages link to Contributions to the geometry of Hamming spaces (Q1242920):
Displayed 41 items.
- An axiomatic system for affine spaces in terms of points, lines, and planes (Q265631) (← links)
- Monotonicity of fitness landscapes and mutation rate control (Q338348) (← links)
- Minimizing the weight of ideals in a layer of the Boolean cube (Q384750) (← links)
- On Chvàtal's conjecture and a conjecture on families of signed sets (Q607378) (← links)
- 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)
- Numerical characterization of \(n\)-cube subset partitioning (Q1026122) (← 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)
- Application of hypergraph Hoffman's bound to intersecting families (Q2152770) (← links)
- The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture (Q2237385) (← links)
- Stability versions of Erdős-Ko-Rado type theorems via isoperimetry (Q2279508) (← links)
- On subsets of the hypercube with prescribed Hamming distances (Q2299612) (← links)
- Intersection theorems under dimension constraints (Q2368655) (← links)
- High dimensional Hoffman bound and applications in extremal combinatorics (Q2700317) (← links)
- AVERAGE DISTANCE AND MINIMUM AVERAGE DISTANCE OF BINARY CONSTANT WEIGHT CODE AND ITS PROPERTIES (Q3063606) (← 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)
- A Note on Large H-Intersecting Families (Q4627480) (← links)
- On the union of intersecting families (Q5222559) (← links)
- On diagnosability of large multiprocessor networks (Q5901447) (← links)
- On the minimum average distance of binary codes: Linear programming approach (Q5939230) (← links)
- STOLARSKY'S INVARIANCE PRINCIPLE FOR FINITE METRIC SPACES (Q6072670) (← links)
- r$r$‐Cross t$t$‐intersecting families via necessary intersection points (Q6096797) (← links)
- The maximum measure of non-trivial 3-wise intersecting families (Q6120852) (← links)