Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances

DOI10.1007/BF02579389zbMath0648.05031MaRDI QIDQ1104935

Peter Frankl

Publication date: 1986

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

Hadamard graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (14)

Codes with given distances ⋮ A new proof of several inequalities on codes and sets ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Pairs of codes with prescribed Hamming distances and coincidences ⋮ A NORMAL NON-CAYLEY-INVARIANT GRAPH FOR THE ELEMENTARY ABELIAN GROUP OF ORDER 64 ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Quantum weakly nondeterministic communication complexity ⋮ Avoiding right angles and certain Hamming distances ⋮ Distinguishing orthogonality graphs ⋮ Embedding bipartite distance graphs under Hamming metric in finite fields ⋮ New results on two hypercube coloring problems ⋮ Sets of vectors with many orthogonal pairs ⋮ Frankl-Rödl-type theorems for codes and permutations ⋮ On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances

Cites Work

• Unnamed Item
• Hadamard graphs. I
• Intersection theorems with geometric consequences
• Four fundamental parameters of a code and their combinatorial significance
• The realization of distances within sets in Euclidean space

This page was built for publication: Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances