Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,789,333 papers from all fields of science
Search
Sign In
Create Free Account
Spherical code
In geometry and coding theory, a spherical code with parameters (n,N,t) is a set of N points on the unit hypersphere in n dimensions for which the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
1 relation
Coding theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Bounds for spherical codes
Peter Keevash
,
B. Sudakov
2016
Corpus ID: 7303871
A set $C$ of unit vectors in $\mathbb{R}^d$ is called an $L$-spherical code if $x \cdot y \in L$ for any distinct $x,y$ in $C…
Expand
Review
2014
Review
2014
DNA Codeword Design: Theory and Applications
M. Garzon
Parallel Processing Letters
2014
Corpus ID: 417842
This is a survey of the origin, current progress and applications of a major roadblock to the development of analytic models for…
Expand
2001
2001
A Point Balance Algorithm for the Spherical Code Problem
Hong-Xuan Huang
,
P. Pardalos
,
Z. Shen
Journal of Global Optimization
2001
Corpus ID: 30503596
AbstractThe Spherical Code (SC) problem has many important applications in such fields as physics, molecular biology, signal…
Expand
2000
2000
Simulational modeling of time-domain magnetic induction using parallel computational schemes: (II) in the spherical coordinates
W. Chou
,
R. Matsumoto
,
F. Tajima
2000
Corpus ID: 15545279
2000
2000
Decoding Spherical Codes Generated by Binary Partitions of Symmetric Pointsets
J. Karlof
,
Guodong Liu
2000
Corpus ID: 6898572
Recently, Ericson and Zinoviev presented a clever, new con struction for spherical codes for the Gaussian channel using ideas of…
Expand
2000
2000
A Ramanujan spherical code
V. De Brunner
,
M. Allali
Conference Record of the Thirty-Fourth Asilomar…
2000
Corpus ID: 38630545
A method for placing points (code vectors) on the unit sphere is presented. This method is based on a Ramanujan set of rotations…
Expand
1994
1994
Polynomial-time construction of codes II. Spherical codes and the kissing number of spheres
G. Lachaud
,
J. Stern
IEEE Transactions on Information Theory
1994
Corpus ID: 27889306
A spherical code is a finite set X of points lying on the unit sphere of R/sup n/. For such a set, we define /spl rho/(X) as the…
Expand
1991
1991
Polynomial-Time Construction of Spherical Codes
G. Lachaud
,
J. Stern
International Symposium on Applied Algebra…
1991
Corpus ID: 17292680
We give a simple lower bound for the dimensions of the families of polynomially constructible spherical codes of given minimal…
Expand
1989
1989
Fast CELP coding based on the Barnes-Wall lattice in 16 dimensions
C. Lamblin
,
J. Adoul
,
D. Massaloux
,
S. Morissette
IEEE International Conference on Acoustics…
1989
Corpus ID: 61568655
The authors present an algebraic code-excited linear prediction (CELP) speech coder where the innovation codebook comes from the…
Expand
1988
1988
Iteratively maximum likelihood decodable spherical codes and a method for their construction
Jiapeng Gao
,
L. Rudolph
,
C. Hartmann
IEEE Transactions on Information Theory
1988
Corpus ID: 36991438
The authors propose a class of spherical codes which can be easily decoded by an efficient iterative maximum likelihood decoding…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE