A heuristic approach for designing cyclic group codes. (7th December 2015)

• Record Type: Journal Article
• Authors: Strapasson, João E.; Torezzan, Cristiano
• Other Names: Lavor Carlile guestEditor.; Firer Marcelo guestEditor.; Martínez José Mario guestEditor.; Liberti Leo guestEditor.
• Is Part Of: International transactions in operational research. Volume 23:Number 5(2016:Sep.)
• Page Start: 883
• Page End: 896
• Publication Date: 2015-12-07
• Subjects: sphere packing -- cyclic group -- spherical codes -- heuristic; Operations research -- Periodicals; 003
• DOI: 10.1111/itor.12238
• Languages: English
• ISSNs: 0969-6016

Abstract

Abstract: In this paper, we propose a heuristic technique for distributing points on the surface of a unit n ‐dimensional Euclidean sphere, generated as the orbit of a finite cyclic subgroup of orthogonal matrices, the so‐called cyclic group codes. Massive numerical experiments were conducted and many new cyclic group codes have been obtained in several dimensions at various rates. The results assure that the performance of the heuristic approach is comparable to a brute‐force search technique with the advantage of having low complexity, which allows designing codes with a large number of points in high dimensions.