Optimum commutative group codes

DOI10.1007/S10623-013-9867-7zbMATH Open1331.94085arXiv1205.4067OpenAlexW2000123186MaRDI QIDQ2256103FDOQ2256103

Rogério M. Siqueira, Sueli I. R. Costa, Cristiano Torezzan, João E. Strapasson

Publication date: 19 February 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: A method for finding an optimum $n$-dimensional commutative group code of a given order $M$ is presented. The approach explores the structure of lattices related to these codes and provides a significant reduction in the number of non-isometric cases to be analyzed. The classical factorization of matrices into Hermite and Smith normal forms and also basis reduction of lattices are used to characterize isometric commutative group codes. Several examples of optimum commutative group codes are also presented.

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

Recommendations

• Commutative group codes in \(\mathbb R^4\), \(\mathbb R^6\), \(\mathbb R^8\) and \(\mathbb R^{16}\)-approaching the bound
• Construction of spherical codes via the hexagonal matrix
• Flat tori, lattices and bounds for commutative group codes
• scientific article; zbMATH DE number 820503
• Group codes generated by finite reflection groups

zbMATH Keywords

latticesHermite normal formgroup codesspherical codes

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Matrices of integers (15B36) Other types of codes (94B60)

Cites Work

• Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
• Title not available (Why is that?)
• Post-Quantum Cryptography
• Title not available (Why is that?)
• Geometrically uniform codes
• Trellis complexity and minimal trellis diagrams of lattices
• On the Trellis Complexity of the Densest Lattice Packings in $\mathbb{R}^n $
• Flat tori, lattices and bounds for commutative group codes
• Signal sets matched to groups
• Cyclic-group codes for the Gaussian channel (Corresp.)
• On the trellis complexity of root lattices and their duals
• Group Codes for the Gaussian Channel
• Title not available (Why is that?)
• Circulant graphs and tessellations on flat tori
• The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
• Minimal syndrome formers for group codes
• The Dynamics of Group Codes: Dual Abelian Group Codes and Systems
• Codes on Euclidean spheres
• On Nearly Orthogonal Lattice Bases and Random Lattices
• Minimal and systematic convolutional codes over finite Abelian groups
• The ML Decoding Performance of LDPC Ensembles Over<tex>$ BBZ _q$</tex>
• LDPC Codes Over Rings for PSK Modulation
• Linear block codes over cyclic groups
• On neighbor distances and symmetry in group codes (Corresp.)
• Constructive Spherical Codes on Layers of Flat Tori
• Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes
• Analysis of Serial Turbo Codes over Abelian Groups for Symmetric Channels
• Group codes generated by finite reflection groups
• Average Spectra and Minimum Distances of Low-Density Parity-Check Codes over Abelian Groups
• Explicit Hard Instances of the Shortest Vector Problem
• Geometrically uniform partitions of L*MPSK constellations and related binary trellis codes
• The Capacity of Finite Abelian Group Codes Over Symmetric Memoryless Channels

Cited In (7)

• A heuristic approach for designing cyclic group codes
• Flat tori, lattices and bounds for commutative group codes
• A min-max theorem for antijamming group codes
• A note on suborthogonal lattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Commutative group codes in \(\mathbb R^4\), \(\mathbb R^6\), \(\mathbb R^8\) and \(\mathbb R^{16}\)-approaching the bound

This page was built for publication: Optimum commutative group codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256103)