You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/66509
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPires Da Nóbrega Neto, T.-
dc.contributor.authorInterlando, J. C.-
dc.contributor.authorFavareto, O. M.-
dc.contributor.authorElia, M.-
dc.contributor.authorPalazzo R., Jr-
dc.date.accessioned2014-05-27T11:20:16Z-
dc.date.accessioned2016-10-25T18:17:02Z-
dc.date.available2014-05-27T11:20:16Z-
dc.date.available2016-10-25T18:17:02Z-
dc.date.issued2001-05-01-
dc.identifierhttp://dx.doi.org/10.1109/18.923731-
dc.identifier.citationIEEE Transactions on Information Theory, v. 47, n. 4, p. 1514-1527, 2001.-
dc.identifier.issn0018-9448-
dc.identifier.urihttp://hdl.handle.net/11449/66509-
dc.identifier.urihttp://acervodigital.unesp.br/handle/11449/66509-
dc.description.abstractWe propose new classes of linear codes over integer rings of quadratic extensions of Q, the field of rational numbers. The codes are considered with respect to a Mannheim metric, which is a Manhattan metric modulo a two-dimensional (2-D) grid. In particular, codes over Gaussian integers and Eisenstein-Jacobi integers are extensively studied. Decoding algorithms are proposed for these codes when up to two coordinates of a transmitted code vector are affected by errors of arbitrary Mannheim weight. Moreover, we show that the proposed codes are maximum-distance separable (MDS), with respect to the Hamming distance. The practical interest in such Mannheim-metric codes is their use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither the Hamming nor the Lee metric is appropriate.en
dc.format.extent1514-1527-
dc.language.isoeng-
dc.sourceScopus-
dc.subjectAlgebraic decoding-
dc.subjectEuclidean domains-
dc.subjectLattices-
dc.subjectLinear codes-
dc.subjectMannheim distance-
dc.subjectNumber fields-
dc.subjectSignal sets matched to groups-
dc.subjectAlgorithms-
dc.subjectCodes (symbols)-
dc.subjectDecoding-
dc.subjectError analysis-
dc.subjectLinearization-
dc.subjectMaximum likelihood estimation-
dc.subjectMaximum principle-
dc.subjectNumber theory-
dc.subjectQuadratic programming-
dc.subjectQuadrature amplitude modulation-
dc.subjectTwo dimensional-
dc.subjectVector quantization-
dc.subjectEinstein-Jacobi integers-
dc.subjectGaussian integers-
dc.subjectHamming distance-
dc.subjectLattice codes-
dc.subjectLattice constellations-
dc.subjectManhattan metric modulo-
dc.subjectMannheim metric-
dc.subjectMaximum distance separable-
dc.subjectQuadratic number fields-
dc.subjectInformation theory-
dc.titleLattice constellations and codes from quadratic number fieldsen
dc.typeoutro-
dc.contributor.institutionUniversidade Estadual Paulista (UNESP)-
dc.description.affiliationDepartamento de Matemática Universidade Estadual Paulista, 15054-000, Sao Jose do Rio Preto-
dc.description.affiliationUnespDepartamento de Matemática Universidade Estadual Paulista, 15054-000, Sao Jose do Rio Preto-
dc.identifier.doi10.1109/18.923731-
dc.identifier.wosWOS:000168790600017-
dc.rights.accessRightsAcesso restrito-
dc.relation.ispartofIEEE Transactions on Information Theory-
dc.identifier.scopus2-s2.0-0035334579-
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.