Trinca, C. C. [UNESP]Carvalho, Edmir Daniel [UNESP]Vieira Filho, Jozué [UNESP]Andrade, A. A. [UNESP]2014-05-202014-05-202012-12-01Journal of The Franklin Institute-engineering and Applied Mathematics. Oxford: Pergamon-Elsevier B.V. Ltd, v. 349, n. 10, p. 3060-3077, 2012.0016-0032http://hdl.handle.net/11449/40092Recently, 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.3060-3077engArtigo10.1016/j.jfranklin.2012.09.007WOS:000312476100007Acesso restrito8940498347481982