| Texto completo | |
| Autor(es): |
Souza, Juliana G. F.
;
Costa, Sueli I. R.
;
Ling, Cong
Número total de Autores: 3
|
| Tipo de documento: | Artigo Científico |
| Fonte: | IEEE TRANSACTIONS ON INFORMATION THEORY; v. 71, n. 11, p. 14-pg., 2025-11-01. |
| Resumo | |
This work presents an extension of the Construction pi(A) lattices proposed by Huang and Narayanan, 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 analyse the performance of the resulting multilevel lattice codes and highlight via computer simulations their notably reduced computational complexity provided by the multistage decoding. Moreover, it is shown that there is a sequence of Construction pi(A) lattices that attain with high probability the Poltyrev-limit. (AU) | |
| Processo FAPESP: | 20/09838-0 - BI0S - Brazilian Institute of Data Science |
| Beneficiário: | João Marcos Travassos Romano |
| Modalidade de apoio: | Auxílio à Pesquisa - Programa Centros de Pesquisa Aplicada |