Construction of perfect space-time codes

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2014-05-27T11:29:00Z
dc.date.accessioned2022-10-05T18:48:42Z
dc.date.available2014-05-27T11:29:00Z
dc.date.available2022-10-05T18:48:42Z
dc.date.created2014-05-27T11:29:00Z
dc.date.issued2013-04-29
dc.identifierProceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013, p. 181-188.
dc.identifierhttp://hdl.handle.net/11449/75186
dc.identifier10.2316/P.2013.798-038
dc.identifier2-s2.0-84876528109
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/3924124
dc.description.abstractIn 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 ℚ(ζ3), where the signal constellations are isomorphic to the hexagonal An 2 -rotated lattice, for any channel of any dimension n such that gcd{n, 3) = 1.
dc.languageeng
dc.relationProceedings of the IASTED International Conference on Signal Processing, Pattern Recognition and Applications, SPPRA 2013
dc.rightsAcesso aberto
dc.sourceScopus
dc.subjectCyclic division algebras
dc.subjectNumber fields
dc.subjectSignal processing
dc.subjectSpace-time block codes
dc.subjectTelecommunications
dc.subjectInnovative methodologies
dc.subjectPerfect codes
dc.subjectSignal constellation
dc.subjectSpace-time block code
dc.subjectData communication systems
dc.subjectPattern recognition
dc.subjectSpace-time block coding (STBC)
dc.subjectTelecommunication
dc.titleConstruction of perfect space-time codes
dc.typeTrabalho apresentado em evento


Este ítem pertenece a la siguiente institución