|
Problemy Peredachi Informatsii, 1993, Volume 29, Issue 2, Pages 28–40
(Mi ppi173)
|
|
|
|
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.
Received: 26.03.1992
Citation:
A. N. Trofimov, “Distance Spectra of Lattice-Based Codes”, Probl. Peredachi Inf., 29:2 (1993), 28–40; Problems Inform. Transmission, 29:2 (1993), 119–131
Linking options:
https://www.mathnet.ru/eng/ppi173 https://www.mathnet.ru/eng/ppi/v29/i2/p28
|
Statistics & downloads: |
Abstract page: | 181 | Full-text PDF : | 82 |
|