| dc.creator | Costa S.I.R. | |
| dc.creator | Strapasson J.E. | |
| dc.creator | Siqueira R.M. | |
| dc.creator | Muniz M. | |
| dc.date | 2006 | |
| dc.date | 2015-06-30T18:02:56Z | |
| dc.date | 2015-11-26T14:17:45Z | |
| dc.date | 2015-06-30T18:02:56Z | |
| dc.date | 2015-11-26T14:17:45Z | |
| dc.date.accessioned | 2018-03-28T21:18:52Z | |
| dc.date.available | 2018-03-28T21:18:52Z | |
| dc.identifier | 8589748049; 9788589748049 | |
| dc.identifier | 2006 International Telecommunications Symposium, Its. , v. , n. , p. 42 - 45, 2006. | |
| dc.identifier | | |
| dc.identifier | 10.1109/ITS.2006.4433239 | |
| dc.identifier | http://www.scopus.com/inward/record.url?eid=2-s2.0-50449103167&partnerID=40&md5=07d5087aa45454f3063a305ce881dca8 | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/102832 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/102832 | |
| dc.identifier | 2-s2.0-50449103167 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1243426 | |
| dc.description | Circulant graphs are homogeneous graphs with special properties which have been used to build interconnection networks for parallel computing. The association of circulant graphs to a spherical codes in dimension 2 k is presented here via the construction of an isomorphic graph supported by a lattice in ℝk. © 2006 SBrT. | |
| dc.description | | |
| dc.description | | |
| dc.description | 42 | |
| dc.description | 45 | |
| dc.description | Adam, A., Research problem 2-10 (1967) J. Combinatorial Theory, 2, p. 393 | |
| dc.description | Biglieri, E., Elia, M., Cyclic-Group Codes for the Gaussian Channel (1976) IEEE Trans. Inform. Theory, Correspondence, pp. 624-629 | |
| dc.description | F. Boesch, R. Tindell, Circulant and Their Connectivities, J. of Graph Theory, 8 (1984) 487-499Costa, S.I.R., Muniz, M., Agustini, E., Palazzo, R., Graphs, Tessellations, and Perfect Codes on Flat Tori (2004) IEEE Trans. Inform. Theory, 50 (10), pp. 2363-2378 | |
| dc.description | Costa, S.I.R., Strapasson, J.E., Muniz, M., Carlos, T.B., Siqueira, R.M., Circulant Graphs Viewed as Graphs on Flat Tori SubmittedElpas, B., Turner, J., Graphs with circulant adjacency matrices (1970) J. Combin. Theory, 9, pp. 229-240 | |
| dc.description | Liskovets, V., Pöschel, R., Counting circulant graphs of prime-power order by decomposing into orbit enumeration problems (2000) Discrete Mathematics, 214, pp. 173-191 | |
| dc.description | Martínez, C., Beivide, R., Gutierrez, J., Gabidulin, E., On the Perfect t-Dominanting Set Problem in Circulant Graphs and Codes over Gaussian Integers (2005) Proceedings ISIT - IEEE International Symposium on Information Theory, pp. 1-5 | |
| dc.description | Slepian, D., Group codes for the Gaussian Channel (1968) The Bell System Technical Journal, 47, pp. 575-602 | |
| dc.description | Siqueira, R., Costa, S.I.R., Minimum Distance Upper Bounds for Commutative Group Codes (2006) Proceedings of IEEE Information Theory Workshop (ITW, , Uruguay, March 13-17 | |
| dc.language | en | |
| dc.publisher | | |
| dc.relation | 2006 International Telecommunications Symposium, ITS | |
| dc.rights | fechado | |
| dc.source | Scopus | |
| dc.title | Circulant Graphs And Spherical Codes | |
| dc.type | Actas de congresos | |
