| dc.contributor | Universidade Estadual Paulista (Unesp) | |
| dc.date.accessioned | 2014-05-20T15:30:47Z | |
| dc.date.accessioned | 2022-10-05T17:01:05Z | |
| dc.date.available | 2014-05-20T15:30:47Z | |
| dc.date.available | 2022-10-05T17:01:05Z | |
| dc.date.created | 2014-05-20T15:30:47Z | |
| dc.date.issued | 2012-12-01 | |
| dc.identifier | Journal of The Franklin Institute-engineering and Applied Mathematics. Oxford: Pergamon-Elsevier B.V. Ltd, v. 349, n. 10, p. 3060-3077, 2012. | |
| dc.identifier | 0016-0032 | |
| dc.identifier | http://hdl.handle.net/11449/40092 | |
| dc.identifier | 10.1016/j.jfranklin.2012.09.007 | |
| dc.identifier | WOS:000312476100007 | |
| dc.identifier | 8940498347481982 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/3911109 | |
| dc.description.abstract | Recently, minimum and non-minimum delay perfect codes were proposed for any channel of dimension n. Their construction appears in the literature as a subset of cyclic division algebras over Q(zeta(3)) only for the dimension n = 2(s)n(1), where s is an element of {0,1}, n(1) is odd and the signal constellations are isomorphic to Z[zeta(3)](n) In this work, we propose an innovative methodology to extend the construction of minimum and non-minimum delay perfect codes as a subset of cyclic division algebras over Q(zeta(3)), where the signal constellations are isomorphic to the hexagonal A(2)(n)-rotated lattice, for any channel of any dimension n such that gcd(n,3) = 1. (C) 2012 The Franklin Institute. Published by Elsevier Ltd. All rights reserved. | |
| dc.language | eng | |
| dc.publisher | Pergamon-Elsevier B.V. Ltd | |
| dc.relation | Journal of The Franklin Institute-engineering and Applied Mathematics | |
| dc.relation | 3.576 | |
| dc.relation | 1,322 | |
| dc.rights | Acesso restrito | |
| dc.source | Web of Science | |
| dc.title | On the construction of perfect codes from HEX signal constellations | |
| dc.type | Artigo | |
