Enregistré dans:
Détails bibliographiques
Auteurs principaux: Souza, Juliana G. F., Costa, Sueli I. R., Ling, Cong
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:https://arxiv.org/abs/2401.10773
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866908374475472896
author Souza, Juliana G. F.
Costa, Sueli I. R.
Ling, Cong
author_facet Souza, Juliana G. F.
Costa, Sueli I. R.
Ling, Cong
contents This work presents an extension of the Construction $π_A$ lattices proposed in \cite{huang2017construction}, to Hurwitz quaternion integers. This construction is provided by using an isomorphism from a version of the Chinese remainder theorem applied to maximal orders in contrast to natural orders in prior works. Exploiting this map, we analyze the performance of the resulting multilevel lattice codes, highlight via computer simulations their notably reduced computational complexity provided by the multistage decoding. Moreover it is shown that this construction effectively attain the Poltyrev-limit.
format Preprint
id arxiv_https___arxiv_org_abs_2401_10773
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Multilevel lattice codes from Hurwitz quaternion integers
Souza, Juliana G. F.
Costa, Sueli I. R.
Ling, Cong
Information Theory
This work presents an extension of the Construction $π_A$ lattices proposed in \cite{huang2017construction}, to Hurwitz quaternion integers. This construction is provided by using an isomorphism from a version of the Chinese remainder theorem applied to maximal orders in contrast to natural orders in prior works. Exploiting this map, we analyze the performance of the resulting multilevel lattice codes, highlight via computer simulations their notably reduced computational complexity provided by the multistage decoding. Moreover it is shown that this construction effectively attain the Poltyrev-limit.
title Multilevel lattice codes from Hurwitz quaternion integers
topic Information Theory
url https://arxiv.org/abs/2401.10773