Larger nearly orthogonal sets over finite fields
From MaRDI portal
Cites work
- A note on Ramsey numbers
- Approximate coloring of uniform hypergraphs
- Broadcasting With Side Information: Bounding and Approximating the Broadcast Rate
- Constructive bounds for a Ramsey-type problem
- High-Rate Storage Codes on Triangle-Free Graphs
- scientific article; zbMATH DE number 17660 (Why is no real title available?)
- scientific article; zbMATH DE number 1045540 (Why is no real title available?)
- scientific article; zbMATH DE number 3019031 (Why is no real title available?)
- Hypergraph containers
- Independent sets in hypergraphs
- Large sets of nearly orthogonal vectors
- Nearly orthogonal sets over finite fields
- On the number of orthogonal systems in vector spaces over finite fields
- Online containers for hypergraphs, with applications to linear equations
- Orthonormal representations of \(H\)-free graphs
- Orthonormal representations, vector chromatic number, and extension complexity
- Pseudo-random graphs
- Sets of vectors with many orthogonal pairs
- Sharp bounds for some multicolour Ramsey numbers
- Some structural properties of low-rank matrices related to computational complexity
- The (generalized) orthogonality dimension of (generalized) Kneser graphs: bounds and applications
This page was built for publication: Larger nearly orthogonal sets over finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028856)