Pages that link to "Item:Q1894016"
From MaRDI portal
The following pages link to A new proof of several inequalities on codes and sets (Q1894016):
Displaying 12 items.
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Set systems with \(k\)-wise \(L\)-intersections and codes with restricted Hamming distances (Q739060) (← links)
- Pairs of codes with prescribed Hamming distances and coincidences (Q851769) (← links)
- Bounds on degrees of \(p\)-adic separating polynomials (Q958742) (← links)
- Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances (Q1865379) (← links)
- An upper bound for the size of \(s\)-distance sets in real algebraic sets (Q2048560) (← links)
- Bounds on sets with few distances (Q2431616) (← links)
- Frankl-Rödl-type theorems for codes and permutations (Q2833012) (← links)
- Erdös--Falconer Distance Problem under Hamming Metric in Vector Spaces over Finite Fields (Q5138969) (← links)
- Avoiding right angles and certain Hamming distances (Q6051134) (← links)
- Embedding bipartite distance graphs under Hamming metric in finite fields (Q6162866) (← links)
