Pages that link to "Item:Q1271885"
From MaRDI portal
The following pages link to The diametric theorem in Hamming spaces---optimal anticodes (Q1271885):
Displaying 50 items.
- Intersection problems in the \(q\)-ary cube (Q272323) (← links)
- The Katona cycle proof of the Erdős-Ko-Rado theorem and its possibilities (Q295831) (← links)
- Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code (Q326314) (← links)
- An analogue of the Erdős-Ko-Rado theorem for weak compositions (Q389467) (← links)
- An Erdős-Ko-Rado theorem for permutations with fixed number of cycles (Q405301) (← links)
- An Erdős-Ko-Rado theorem for cross \(t\)-intersecting families (Q458297) (← links)
- A sharp bound for the product of weights of cross-intersecting families (Q504984) (← links)
- Towards extending the Ahlswede-Khachatrian theorem to cross \(t\)-intersecting families (Q516792) (← links)
- Optimal permutation anticodes with the infinity norm via permanents of \((0,1)\)-matrices (Q543906) (← links)
- Strongly intersecting integer partitions (Q740661) (← links)
- Intersection theorem for finite permutations (Q764250) (← links)
- Optimal tristance anticodes in certain graphs (Q817597) (← links)
- A non-trivial intersection theorem for permutations with fixed number of cycles (Q898122) (← links)
- The edge-diametric theorem in Hamming spaces (Q947095) (← links)
- A multiply intersecting Erdős-Ko-Rado theorem -- the principal case (Q960953) (← links)
- Multiple cross-intersecting families of signed sets (Q965233) (← links)
- Some Erdős-Ko-Rado theorems for injections (Q966141) (← links)
- On \(t\)-intersecting families of signed sets and permutations (Q1025955) (← links)
- Models of multi-user write-efficient memories and general diametric theorems (Q1363782) (← links)
- A diametric theorem for edges (Q1586122) (← links)
- More complete intersection theorems (Q1618227) (← links)
- Non-trivially intersecting multi-part families (Q1703447) (← links)
- The \(t\)-intersection problem in the truncated Boolean lattice (Q1864563) (← links)
- On cross \(t\)-intersecting families of sets (Q1957972) (← links)
- On robust colorings of Hamming-distance graphs (Q1991409) (← links)
- An Erdős-Ko-Rado theorem for unions of length 2 paths (Q2005709) (← links)
- Anticodes in the sum-rank metric (Q2120919) (← links)
- Application of hypergraph Hoffman's bound to intersecting families (Q2152770) (← links)
- On subsets of the hypercube with prescribed Hamming distances (Q2299612) (← links)
- Erdős-Ko-Rado theorems for set partitions with certain block size (Q2299629) (← links)
- AK-type stability theorems on cross \(t\)-intersecting families (Q2323248) (← links)
- A Deza-Frankl type theorem for set partitions (Q2341077) (← links)
- Cross-intersecting families of vectors (Q2345515) (← links)
- A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets (Q2346594) (← links)
- The maximum product of sizes of cross-intersecting families (Q2359973) (← links)
- The weighted complete intersection theorem (Q2363359) (← links)
- Intersection theorems under dimension constraints (Q2368655) (← links)
- Multiply-intersecting families revisited (Q2384803) (← links)
- The maximum sum and the maximum product of sizes of cross-intersecting families (Q2509742) (← links)
- The maximum measure of 3-wise \(t\)-intersecting families (Q2701004) (← links)
- Frankl-Rödl-type theorems for codes and permutations (Q2833012) (← links)
- Cross \(t\)-intersecting integer sequences from weighted Erdős-Ko-Rado (Q2841493) (← links)
- Cross-Intersecting Families of Vectors (Q2945671) (← links)
- The maximum product of weights of cross-intersecting families (Q2958298) (← links)
- Friedgut--Kalai--Naor theorem for slices of the Boolean cube (Q3179336) (← links)
- The Edge-Diametric Theorem in Hamming Spaces (Q3439257) (← links)
- An extension of the Erdős–Ko–Rado Theorem (Q3439573) (← links)
- A Diametric Theorem in ${\mathbb Z}^n_m$ for Lee and Related Distances (Q3540915) (← links)
- Fundamentals of coding type problems (Q3637813) (← links)
- Intersecting families, signed sets, and injection (Q5109063) (← links)
