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