Information Theory and Coding Theory

Distance Spectra of Lattice-Based Codes

A. N. Trofimov


Abstract: We consider the problem of finding the distance spectrum for a finite subset of a lattice. As basic examples of such subsets, we consider the codes with constant norm (spherical codes) and the codes with bounded norm (spherical clusters). The problem is solved using the extended lattice generating function. The computational results for particular examples are presented. The asymptotics of the distance spectrum is investigated.

UDC: 621.391.15:519.1

Received: 26.03.1992

 English version: Problems of Information Transmission, 1993, 29:2, 119–131

Bibliographic databases:

• 
•