Los puntos clave no están disponibles para este artículo en este momento.
Let S (n, t, k) be the maximum size of a code containing only vectors of the kth shell of the integer lattice Zⁿ such that the inner product between distinct vectors does not exceed t. In this paper we compute lower bounds for S (n, t, k) for small values of n, t and k by carrying out computer searches for codes with prescribed automorphisms. We prescribe groups of signed permutation automorphisms acting transitively on the pairs of coordinates and coordinate values as well as other closely related groups of automorphisms. Several of the constructed codes lead to improved lower bounds for spherical codes.
Mikhail et al. (Thu,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: