Orthogonal vectors in the n-dimensional cube and codes with missing distances
From MaRDI portal
Publication:1104935
Recommendations
- On the orthogonality of geometric codes
- Nearly orthogonal vectors and small antipodal spherical codes
- Geometric orthogonal codes and geometrical difference packings
- Orthogonal F-rectangles, orthogonal arrays, and codes
- Orthogonality of binary codes derived from Reed-Solomon codes
- Orthogonal, antiorthogonal and self-orthogonal matrices and their codes
- On codes with distances \(d\) and \(n\)
- Error correcting codes arising from cubes
- scientific article; zbMATH DE number 1189020
- Orbit matrices of Hadamard matrices and related codes
Cites work
Cited in
(16)- Codes with given distances
- A new proof of several inequalities on codes and sets
- Avoiding right angles and certain Hamming distances
- New results on two hypercube coloring problems
- On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
- Pairs of codes with prescribed Hamming distances and coincidences
- Frankl-Rödl-type theorems for codes and permutations
- Sets of vectors with many orthogonal pairs
- Simplicity conditions for binary orthogonal arrays
- Embedding bipartite distance graphs under Hamming metric in finite fields
- Cubes of integral vectors in dimension four
- A NORMAL NON-CAYLEY-INVARIANT GRAPH FOR THE ELEMENTARY ABELIAN GROUP OF ORDER 64
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances
- Distinguishing orthogonality graphs
- Upper bounds for \(s\)-distance sets and equiangular lines
- Quantum weakly nondeterministic communication complexity
This page was built for publication: Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104935)
