The authors propose a class of spherical codes which can be easily decoded by an efficient iterative maximum likelihood decoding algorithm. A necessary and sufficient condition for a spherical code to be iteratively maximum likelihood decodable is formulated. A systematic construction method for such codes based on shrinking of Voronoi corners is analyzed. The base code used for construction is the binary maximal length sequence code. The second-level construction is described. Computer simulation results for selected codes constructed by the proposed method are given.>
No takes yet. Share an insight, caveat, or question.
Gao et al. (1988) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: