scientific article; zbMATH DE number 3818560
From MaRDI portal
Publication:3665801
zbMATH Open0517.52009MaRDI QIDQ3665801FDOQ3665801
Authors: Vladimir Levenshtein 
Publication date: 1983
Title of this publication is not available (Why is that?)
Coding theorems (Shannon theory) (94A24) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Lattice packing and covering (number-theoretic aspects) (11H31) Estimates on character sums (11L40)
Cited In (39)
- On lower bounds on the spectrum of a binary code
- Constructions of asymptotically optimal codebooks with respect to Welch bound and Levenshtein bound
- On the size of incoherent systems
- Two constructions of asymptotically optimal codebooks according to the Welch bound
- Computing distance distributions of spherical designs
- Algebraic-geometric codes and asymptotic problems
- On zeros of discrete orthogonal polynomials
- On deterministic sketching and streaming for sparse recovery and norm estimation
- Two classes of near-optimal codebooks with respect to the Welch bound
- Kissing number in non-Euclidean spaces of constant sectional curvature
- Energy bounds for codes in polynomial metric spaces
- Estimates of the distance distribution of codes and designs
- An extremum problem for polynomials and bounds for codes with given distance and diameter
- Bounds for spherical codes: the Levenshtein framework lifted
- Hybrid character sums and near-optimal partial Hadamard codebooks
- On polarization of spherical codes and designs
- Packing dimension and Ahlfors regularity of porous sets in metric spaces
- Deterministic convolutional compressed sensing matrices
- Nearly optimal codebooks from generalized Boolean bent functions over \(\mathbb{Z}_4\)
- A further construction of asymptotically optimal codebooks with multiplicative characters
- Codebooks from generalized bent \(\mathbb{Z}_4\)-valued quadratic forms
- Bounds for the sum of distances of spherical sets of small size
- 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
- Nearly optimal codebooks based on generalized Jacobi sums
- Improved upper bounds for parent-identifying set systems and separable codes
- The extremal function in the Delsarte problem of finding an upper bound for the kissing number in the three-dimensional space
- Gaussian sums, hyper Eisenstein sums and Jacobi sums over a local ring and their applications
- On spherical codes generating the kissing number in dimensions 8 and 24
- A large family of sequences with low periodic correlation
- Equivalence of Delsarte's bounds for codes and designs in symmetric association schemes, and some applications
- Optimal codebooks achieving the Levenshtein bound from generalized bent functions over \(\mathbb {Z}_{4}\)
- Covering spheres with spheres
- Energy bounds for codes and designs in Hamming spaces
- Cayley sum graphs and their applications to codebooks
- Universal lower bounds for potential energy of spherical codes
- The packing density of the \(n\)-dimensional cross-polytope
- Title not available (Why is that?)
- Properties of tight frames that are regular schemes
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)
