Artículos de revistas
A Heuristic Approach For Designing Cyclic Group Codes
Registro en:
International Transactions In Operational Research. Wiley-blackwell, v. 23, p. 883 - 896, 2016.
0969-6016
1475-3995
WOS:000388294800006
10.1111/itor.12238
Autor
Strapasson
Joao E.; Torezzan
Cristiano
Institución
Resumen
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. 23 5 883 896