A heuristic approach for designing cyclic group codes

DOI10.1111/itor.12238zbMath1348.90556arXiv1509.05454OpenAlexW2962936826MaRDI QIDQ2827760

Cristiano Torezzan, João Eloir Strapasson

Publication date: 21 October 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.05454

zbMATH Keywords

heuristiccyclic groupspherical codessphere packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (1)

A shape-gain approach for vector quantization based on flat tori

Cites Work

• Unnamed Item
• Flat tori, lattices and bounds for commutative group codes
• Optimum commutative group codes
• Geometrically uniform codes
• Signal sets matched to groups
• Cyclic-group codes for the Gaussian channel (Corresp.)
• Asymptotically dense spherical codes. I. Wrapped spherical codes
• Asymptotically dense spherical codes .II. laminated spherical codes
• Gaussian source coding with spherical codes
• Group codes generated by finite reflection groups
• The Capacity of Finite Abelian Group Codes Over Symmetric Memoryless Channels
• Constructive Spherical Codes on Layers of Flat Tori
• Group Codes for the Gaussian Channel
• Commutative group codes for the Gaussian channel

This page was built for publication: A heuristic approach for designing cyclic group codes