Asymptotically dense spherical codes. I. Wrapped spherical codes (Q4392379)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1160178
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotically dense spherical codes. I. Wrapped spherical codes |
scientific article; zbMATH DE number 1160178 |
Statements
Asymptotically dense spherical codes. I. Wrapped spherical codes (English)
0 references
26 January 1999
0 references
spherical codes
0 references
source coding
0 references
channel coding
0 references
laminated lattices
0 references
packing
0 references
asymptotic density
0 references
0.9162777066230774
0 references
0.806778073310852
0 references
0.8009830713272095
0 references
0.8006899356842041
0 references
This paper presents new spherical code constructions (called wrapped spherical codes) that are asymptotically dense as the minimum distance tends to zero. These codes have been constructed by mapping finite subsets of sphere packings to the unit sphere in one higher dimension. In addition to being asymptotically optimal, it is shown that these also outperform other codes for moderate sizes of minimum distance. This has also been demonstrated numerically. [For Part II, see the review Zbl 0904.94021 below].
0 references