The following pages link to (Q3665801):
Displayed 37 items.
- Deterministic convolutional compressed sensing matrices (Q324274) (← links)
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\) (Q502403) (← links)
- Energy bounds for codes and designs in Hamming spaces (Q510492) (← links)
- An extremum problem for polynomials and bounds for codes with given distance and diameter (Q596963) (← links)
- On the size of incoherent systems (Q719361) (← links)
- Universal lower bounds for potential energy of spherical codes (Q730083) (← links)
- On zeros of discrete orthogonal polynomials (Q1008711) (← links)
- Algebraic-geometric codes and asymptotic problems (Q1180622) (← links)
- On spherical codes generating the kissing number in dimensions 8 and 24 (Q1199603) (← links)
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications (Q1292857) (← links)
- A large family of sequences with low periodic correlation (Q1377675) (← links)
- Nearly optimal codebooks based on generalized Jacobi sums (Q1801063) (← links)
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces (Q1805056) (← links)
- Extremal polynomials for obtaining bounds for spherical codes and designs (Q1895969) (← links)
- Computing distance distributions of spherical designs (Q1899412) (← links)
- Two constructions of asymptotically optimal codebooks according to the Welch bound (Q2008811) (← links)
- Two classes of near-optimal codebooks with respect to the Welch bound (Q2025366) (← links)
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\) (Q2158234) (← links)
- On lower bounds on the spectrum of a binary code (Q2190925) (← links)
- Properties of tight frames that are regular schemes (Q2202895) (← links)
- Improved upper bounds for parent-identifying set systems and separable codes (Q2220762) (← links)
- A further construction of asymptotically optimal codebooks with multiplicative characters (Q2280311) (← links)
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms (Q2286597) (← links)
- Energy bounds for codes in polynomial metric spaces (Q2318064) (← links)
- The packing density of the \(n\)-dimensional cross-polytope (Q2354679) (← links)
- On deterministic sketching and streaming for sparse recovery and norm estimation (Q2437337) (← links)
- Covering spheres with spheres (Q2471717) (← links)
- The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space (Q2516599) (← links)
- Bounds for the sum of distances of spherical sets of small size (Q2689513) (← links)
- Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications (Q2689915) (← links)
- On polarization of spherical codes and designs (Q2695978) (← links)
- Cayley sum graphs and their applications to codebooks (Q2697479) (← links)
- Estimates of the distance distribution of codes and designs (Q4544541) (← links)
- Kissing number in non-Euclidean spaces of constant sectional curvature (Q4999491) (← links)
- Bounds for spherical codes: The Levenshtein framework lifted (Q5856745) (← links)
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound (Q6047448) (← links)
- Hybrid character sums and near-optimal partial Hadamard codebooks (Q6052932) (← links)