Optimum commutative group codes
A code \(C(M,n,d)\) with a given order \(M\), dimension \(n\) and minimum distance \(d\) is said to be optimum, if \(d\) is the largest minimum distance for a fixed \(M\) and \(n\). After a preliminary presentation of commutative group codes and some of their properties the authors discuss the initial vector problem for those codes and they characterize it as a linear programming problem. Then the main results of this paper are presented: the authors prove an extended Hermite normal form, which allows the characterization of isometric lattices by coordinate permutation. Also two theorems are proved, which provide a significant reduction in the number of codes to be checked when searching an optimum one. In the end of this paper the authors present their method as a pseudo-code and they give also many examples of optimum commutative group codes.
- 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
- Analysis of Serial Turbo Codes over Abelian Groups for Symmetric Channels
- Average spectra and minimum distances of low-density parity-check codes over Abelian groups
- Circulant graphs and tessellations on flat tori
- Codes on Euclidean spheres
- Constructive Spherical Codes on Layers of Flat Tori
- Cyclic-group codes for the Gaussian channel (Corresp.)
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- Explicit Hard Instances of the Shortest Vector Problem
- Flat tori, lattices and bounds for commutative group codes
- Geometrically uniform codes
- Geometrically uniform partitions of L*MPSK constellations and related binary trellis codes
- Group Codes for the Gaussian Channel
- Group codes generated by finite reflection groups
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 4183329 (Why is no real title available?)
- Labelings and encoders with the uniform bit error property with applications to serially concatenated trellis codes
- LDPC Codes Over Rings for PSK Modulation
- Linear block codes over cyclic groups
- Minimal and systematic convolutional codes over finite Abelian groups
- Minimal syndrome formers for group codes
- On Nearly Orthogonal Lattice Bases and Random Lattices
- On neighbor distances and symmetry in group codes (Corresp.)
- On the trellis complexity of root lattices and their duals
- On the Trellis Complexity of the Densest Lattice Packings in $\mathbb{R}^n $
- Post-Quantum Cryptography
- Signal sets matched to groups
- The Capacity of Finite Abelian Group Codes Over Symmetric Memoryless Channels
- The Dynamics of Group Codes: Dual Abelian Group Codes and Systems
- The dynamics of group codes: state spaces, trellis diagrams, and canonical encoders
- The ML Decoding Performance of LDPC Ensembles Over<tex>$ BBZ _q$</tex>
- Trellis complexity and minimal trellis diagrams of lattices
- Flat tori, lattices and bounds for commutative group codes
- A note on suborthogonal lattices
- A heuristic approach for designing cyclic group codes
- A min-max theorem for antijamming group codes
- Commutative group codes in \(\mathbb R^4\), \(\mathbb R^6\), \(\mathbb R^8\) and \(\mathbb R^{16}\)-approaching the bound
- scientific article; zbMATH DE number 3558059 (Why is no real title available?)
- scientific article; zbMATH DE number 820503 (Why is no real title available?)
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)
