scientific article; zbMATH DE number 3818560
From MaRDI portal
Publication:3665801
Cited in
(40)- On zeros of discrete orthogonal polynomials
- Algebraic-geometric codes and asymptotic problems
- On spherical codes generating the kissing number in dimensions 8 and 24
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- A large family of sequences with low periodic correlation
- Nearly optimal codebooks based on generalized Jacobi sums
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Extremal polynomials for obtaining bounds for spherical codes and designs
- Computing distance distributions of spherical designs
- Two constructions of asymptotically optimal codebooks according to the Welch bound
- Two classes of near-optimal codebooks with respect to the Welch bound
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
- On lower bounds on the spectrum of a binary code
- Properties of tight frames that are regular schemes
- Improved upper bounds for parent-identifying set systems and separable codes
- A further construction of asymptotically optimal codebooks with multiplicative characters
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- Energy bounds for codes in polynomial metric spaces
- The packing density of the \(n\)-dimensional cross-polytope
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Covering spheres with spheres
- The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
- Bounds for the sum of distances of spherical sets of small size
- Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
- On polarization of spherical codes and designs
- Cayley sum graphs and their applications to codebooks
- Deterministic convolutional compressed sensing matrices
- scientific article; zbMATH DE number 59914 (Why is no real title available?)
- Estimates of the distance distribution of codes and designs
- Kissing number in non-Euclidean spaces of constant sectional curvature
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
- Energy bounds for codes and designs in Hamming spaces
- Bounds for spherical codes: the Levenshtein framework lifted
- An extremum problem for polynomials and bounds for codes with given distance and diameter
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
- Hybrid character sums and near-optimal partial Hadamard codebooks
- On the size of incoherent systems
- Chebyshev systems and Sturm oscillation theory for discrete polynomials
- Universal lower bounds for potential energy of spherical codes
- Packing dimension and Ahlfors regularity of porous sets in metric spaces
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3665801)
