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.











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)