dc.creatorQuilles C.
dc.creatorPalazzo Jr. R.
dc.date2010
dc.date2015-06-26T12:40:44Z
dc.date2015-11-26T15:07:07Z
dc.date2015-06-26T12:40:44Z
dc.date2015-11-26T15:07:07Z
dc.date.accessioned2018-03-28T22:17:33Z
dc.date.available2018-03-28T22:17:33Z
dc.identifier9781424469604
dc.identifierIeee International Symposium On Information Theory - Proceedings. , v. , n. , p. 1158 - 1162, 2010.
dc.identifier21578103
dc.identifier10.1109/ISIT.2010.5513673
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-77955683305&partnerID=40&md5=d6379401c135e0139ba8f27fb1f621f0
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/91361
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/91361
dc.identifier2-s2.0-77955683305
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1257388
dc.descriptionIn this paper we present a generalization of the perfect codes derived from the quotient rings of Gaussian integers. We call this class of codes quasi-perfect, which in addition to preserving the property of being geometrically uniform codes they are able to correct more error patterns than the perfect codes. © 2010 IEEE.
dc.description
dc.description
dc.description1158
dc.description1162
dc.descriptionForney, G.D., Geometrically uniform codes (1991) IEEE Trans. on Inform. Theory, 37 (5), pp. 1241-1260. , September
dc.descriptionGolomb, S.W., Welch, L.R., Perfect codes in the lee metric and the packing of the polyominoes (1970) SIAM J. Applied Mathematics, 18 (2), pp. 302-317
dc.descriptionCosta, S.I., Muniz, M., Agustini, E., Palazzo, R., Graphs, tessellations, and perfect codes on flat tori (2004) IEEE Trans. on Inform. Theory, 50 (10), pp. 2363-2377. , October
dc.descriptionMartínez, C., Beivide, R., Gabidulin, E., On the perfect t-dominating set problem in circulant graphs and codes over Gaussian integers (2005) Proc. IEEE Intl. Symp. Information Theory, pp. 254-258. , Adelaide, Australia, September
dc.descriptionMartínez, C., Beivide, R., Gabidulin, E., Perfect codes from metrics induced by circulant graphs (2007) IEEE Trans. on Inform. Theory, 53 (9), pp. 3042-3052. , September
dc.descriptionMartínez, C., Beivide, R., Gabidulin, E., Perfect codes from cayley graphs over lipschitz integers (2009) IEEE Trans. on Inform. Theory, 55 (8), pp. 3552-3562. , August
dc.descriptionSamuel, P., (1967) Algebraic Theory of Numbers, , Herman, Paris
dc.descriptionStewart, I., Tall, D., (1987) Algebraic Number Theory, , New York: Chapman-Hall
dc.descriptionHungerford, T.W., (1974) Algebra, , New York: Springer Verlag
dc.languageen
dc.publisher
dc.relationIEEE International Symposium on Information Theory - Proceedings
dc.rightsfechado
dc.sourceScopus
dc.titleQuasi-perfect Geometrically Uniform Codes Derived From Graphs Over Gaussian Integer Rings
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución