Name
Abstract | ||
|---|---|---|
The Leech lattice is a regular arrangement of points in 24-dimensional Euclidean space that yields an extremely dense packing when equal spheres are centered at these points. A subset of the Leech lattice can be used as a signal set for the Gaussian channel or as representative vectors for a vector quantizer. Of particular interest are the spherical codes (or code books) that consist of the points of the Leech lattice which lie on a sphere centered at the origin. The code points do not have to be stored because they can be obtained from a very small set of basic vectors using permutations of the components in a manner dictated by the words of the extended Golay code. A nearest-neighbor algorithm that works on this is developed to determine the point in the code closet to some arbitrary vector in R24. The performance of this approach when quantizing independent identically distributed Gaussian samples is reported |
Year | DOI | Venue |
|---|---|---|
1988 | 10.1109/18.21247 | IEEE Transactions on Information Theory - Part 1 |
Keywords | Field | DocType |
codes,data compression,encoding,telecommunication channels,Euclidean space,Gaussian channel,Leech lattice,code books,extended Golay code,nearest neighbour algorithm,signal set,spherical codes,vector quantisation | k-nearest neighbors algorithm,Discrete mathematics,Combinatorics,Permutation,Leech lattice,Euclidean space,Gaussian,Binary Golay code,Quantization (signal processing),Small set,Mathematics | Journal |
Volume | Issue | ISSN |
34 | 5 | 0018-9448 |
Citations | PageRank | References |
13 | 2.08 | 12 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. Adoul | 1 | 290 | 63.42 |
| Michel Barth | 2 | 13 | 2.08 |