On the effective computation of isomorphisms between and GF
From MaRDI portal
The authors present two algorithms, one that is a field isomorphism from a certain embedding in \(\mathbb R^n\) to a Galois field and the other to explicitly compute its inverse. The end result is a systematic technique for constructing, encoding, and decoding multidimensional lattice constellations with practical applications.
Recommendations
Cites work
- Channel coding with multilevel/phase signals
- Codes over Gaussian integers
- scientific article; zbMATH DE number 3138903 (Why is no real title available?)
- scientific article; zbMATH DE number 3151600 (Why is no real title available?)
- scientific article; zbMATH DE number 1314682 (Why is no real title available?)
- scientific article; zbMATH DE number 194764 (Why is no real title available?)
- scientific article; zbMATH DE number 3342087 (Why is no real title available?)
- scientific article; zbMATH DE number 965581 (Why is no real title available?)
- Sphere packings, lattices and groups. With additional contributions by E. Bannai, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov
- The Leech lattice as a code for the Gaussian channel
This page was built for publication: On the effective computation of isomorphisms between and GF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4670759)