Pages that link to "Item:Q1104935"
From MaRDI portal
The following pages link to Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances (Q1104935):
Displaying 16 items.
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Pairs of codes with prescribed Hamming distances and coincidences (Q851769) (← links)
- Codes with given distances (Q1094390) (← links)
- Sets of vectors with many orthogonal pairs (Q1205349) (← links)
- Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances (Q1865379) (← links)
- A new proof of several inequalities on codes and sets (Q1894016) (← links)
- New results on two hypercube coloring problems (Q2446885) (← links)
- Simplicity conditions for binary orthogonal arrays (Q2678983) (← links)
- Frankl-Rödl-type theorems for codes and permutations (Q2833012) (← links)
- Cubes of integral vectors in dimension four (Q2859352) (← links)
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs (Q5081783) (← links)
- A NORMAL NON-CAYLEY-INVARIANT GRAPH FOR THE ELEMENTARY ABELIAN GROUP OF ORDER 64 (Q5322927) (← links)
- Avoiding right angles and certain Hamming distances (Q6051134) (← links)
- Distinguishing orthogonality graphs (Q6056750) (← links)
- Embedding bipartite distance graphs under Hamming metric in finite fields (Q6162866) (← links)
