{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T20:21:29Z","timestamp":1703103689929},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,4,21]],"date-time":"2012-04-21T00:00:00Z","timestamp":1334966400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s10623-012-9666-6","type":"journal-article","created":{"date-parts":[[2012,4,20]],"date-time":"2012-04-20T06:52:20Z","timestamp":1334904740000},"page":"77-90","source":"Crossref","is-referenced-by-count":8,"title":["A generalization of Lee codes"],"prefix":"10.1007","volume":"70","author":[{"given":"C.","family":"Araujo","sequence":"first","affiliation":[]},{"given":"I.","family":"Dejter","sequence":"additional","affiliation":[]},{"given":"P.","family":"Horak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,21]]},"reference":[{"key":"9666_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-78602-3","volume-title":"Lectures on Advances in Combinatorics","author":"R. Ahlswede","year":"2008","unstructured":"Ahlswede R., Blinovsky V.: Lectures on Advances in Combinatorics. Springer, Berlin (2008)"},{"key":"9666_CR2","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1023\/A:1008394205999","volume":"22","author":"R. Ahlswede","year":"2001","unstructured":"Ahlswede R., Audinian H.K., Khachatrian L.H.: On perfect codes and related concepts. Des. Codes Cryptogr. 22, 221\u2013237 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"9666_CR3","doi-asserted-by":"crossref","first-page":"1535","DOI":"10.1109\/TIT.2003.811922","volume":"49","author":"B.F. AlBdaiwi","year":"2003","unstructured":"AlBdaiwi B.F., Bose B.: Quasi-perfect Lee distance codes. IEEE Trans. Inf. Theory 49, 1535\u20131539 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9666_CR4","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/B:SUPE.0000022572.95414.27","volume":"29","author":"B.F. AlBdaiwi","year":"2004","unstructured":"AlBdaiwi B.F., Livingston M.L.: Perfect distance d-placements in 2d-toroidal networks. J. Supercomput. 29, 45\u201357 (2004)","journal-title":"J. Supercomput."},{"key":"9666_CR5","unstructured":"Araujo C., Dejter I.J.: On perfectly dominating $${\\mathbb{Z}^{3}}$$ with squares (submitted)."},{"key":"9666_CR6","unstructured":"Bange D.W., Barkauskas A.E., Slater P.J.: Efficient dominating sets in graphs. In: Ringeisen R.D., Roberts F.S. (eds.) Applications in Discrete Mathematics, pp. 189\u2013199. SIAM, Philadelphia (1988)."},{"key":"9666_CR7","volume-title":"Algebraic Graph Theory","author":"N. Biggs","year":"1993","unstructured":"Biggs N.: Algebraic Graph Theory. Cambridge University Press, Cambridge (1993)"},{"key":"9666_CR8","unstructured":"Buzaglo S., Etzion T.: Tilings by (0.5, n)-Crosses and Perfect Codes. online: arXiv:1107.5706v1."},{"key":"9666_CR9","doi-asserted-by":"crossref","first-page":"2363","DOI":"10.1109\/TIT.2004.834754","volume":"50","author":"S.I. Costa","year":"2004","unstructured":"Costa S.I., Muniz M., Agustini E., Palazzo R.: Graphs, tessellations, and perfect codes on flat tori. IEEE Trans. Inf. Theory 50, 2363\u20132377 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9666_CR10","first-page":"99","volume":"42","author":"I.J. Dejter","year":"2008","unstructured":"Dejter I.J.: Perfect domination in regular grid graphs. Australas. J. Comb. 42, 99\u2013114 (2008)","journal-title":"Australas. J. Comb."},{"key":"9666_CR11","first-page":"177","volume":"70","author":"I.J. Dejter","year":"2009","unstructured":"Dejter I.J., Delgado A.A.: Perfect domination in rectangular grid graphs. J. Comb. Math. Comb. Comput. 70, 177\u2013196 (2009)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"9666_CR12","unstructured":"Dejter I.J., Phelps K.T.: Ternary Hamming and binary perfect covering codes. In: Barg A., Litsyn S. (eds.) Codes and Association Schemes. DIMACS Series Discrete Mathematics and Theoretical Computer Science, vol. 56, pp. 111\u2013113. American Mathematical Society, Providence (2001)."},{"key":"9666_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0166-218X(02)00573-5","volume":"119","author":"I.J. Dejter","year":"2003","unstructured":"Dejter I.J., Serra O.: Efficient dominating sets in Cayley graphs. Discret. Appl. Math. 119, 319\u2013328 (2003)","journal-title":"Discret. Appl. Math."},{"key":"9666_CR14","first-page":"67","volume":"94","author":"I.J. Dejter","year":"1993","unstructured":"Dejter I.J., Weichsel P.M.: Twisted perfect dominating subgraphs of hypercubes. Congr. Numerantium 94, 67\u201378 (1993)","journal-title":"Congr. Numerantium"},{"key":"9666_CR15","unstructured":"Etzion T.: Product constructions for perfect Lee codes. IEEE Trans. Inf. Theory (to appear)."},{"key":"9666_CR16","first-page":"141","volume":"3","author":"M.R. Fellows","year":"1991","unstructured":"Fellows M.R., Hoover M.N.: Perfect domination. Australas. J. Comb. 3, 141\u2013150 (1991)","journal-title":"Australas. J. Comb."},{"key":"9666_CR17","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1137\/0118025","volume":"18","author":"S. Golomb","year":"1970","unstructured":"Golomb S., Welch K.: Perfect codes in the Lee metric and the packing of polyominos. SIAM J. Appl. Math. 18, 302\u2013317 (1970)","journal-title":"SIAM J. Appl. Math."},{"key":"9666_CR18","doi-asserted-by":"crossref","first-page":"96","DOI":"10.2140\/pjm.1986.122.95","volume":"122","author":"D. Hickerson","year":"1986","unstructured":"Hickerson D., Stein S.: Abelian groups and packings by semicrosses. Pac. J. Math. 122, 96\u2013109 (1986)","journal-title":"Pac. J. Math."},{"key":"9666_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s00454-011-9373-5","volume":"47","author":"P. Horak","year":"2012","unstructured":"Horak P., AlBdaiwi B.F.: Non-periodic tilings of R n by crosses. Discret. Comput. Geom. 47, 1\u201316 (2012)","journal-title":"Discret. Comput. Geom."},{"key":"9666_CR20","unstructured":"Horak P., AlBdaiwi B.F.: Diameter perfect Lee codes. IEEE Trans. Inf. Theory. Online: arXiv:1109.3475 (to appear)."},{"key":"9666_CR21","first-page":"61","volume":"46","author":"W.F. Klostermeyer","year":"2006","unstructured":"Klostermeyer W.F., Goldwasser J.L.: Total perfect codes in grid codes. Bull. Inst. Comb. Appl. 46, 61\u201368 (2006)","journal-title":"Bull. Inst. Comb. Appl."},{"key":"9666_CR22","doi-asserted-by":"crossref","unstructured":"Kratochvil J., Kriv\u00e1nek M.: On the computational complexity of codes in graphs. In: Proceedings of the MFCS 1988. Lecture Notes in Computer Science, vol. 324, pp. 396\u2013404, Springer, Berlin.","DOI":"10.1007\/BFb0017162"},{"key":"9666_CR23","unstructured":"Minkowksi H.: Dichteste gitterformige Lagerung kongruenter Korper. Nachrichten Ges. Wiss. Gottingen, pp. 311\u2013355 (1904)."},{"key":"9666_CR24","first-page":"177","volume":"51","author":"E. Moln\u00e1r","year":"1971","unstructured":"Moln\u00e1r E.: Sui Mosaici dello spazio de dimensione n. Atti della Accademia Nazionale dei Lincei. Rend. Sc. Fis. Mat. e Nat. 51, 177\u2013185 (1971)","journal-title":"Rend. Sc. Fis. Mat. e Nat."},{"key":"9666_CR25","unstructured":"Schwartz M.: Quasi-cross lattice tilings with applications to flash memory (submitted)."},{"key":"9666_CR26","doi-asserted-by":"crossref","first-page":"523","DOI":"10.2140\/pjm.1967.22.523","volume":"22","author":"S. Stein","year":"1967","unstructured":"Stein S.: Factoring by subsets. Pac. J. Math. 22, 523\u2013541 (1967)","journal-title":"Pac. J. Math."},{"key":"9666_CR27","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TIT.1984.1056880","volume":"30","author":"S. Stein","year":"1984","unstructured":"Stein S.: Packings of R n by certain error spheres. IEEE Trans. Inf. Theory 30, 356\u2013363 (1984)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9666_CR28","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF01917533","volume":"38","author":"S. Szab\u00f3","year":"1981","unstructured":"Szab\u00f3 S.: On mosaics consisting of multidimensional crosses. Acta Math. Acad. Sci. Hung. 38, 191\u2013203 (1981)","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"9666_CR29","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1002\/jgt.3190180506","volume":"18","author":"P.M. Weichsel","year":"1994","unstructured":"Weichsel P.M.: Dominating sets of n-cubes. J. Graph Theory 18, 479\u2013488 (1994)","journal-title":"J. Graph Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9666-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9666-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9666-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,27]],"date-time":"2019-06-27T16:08:21Z","timestamp":1561651701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9666-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,21]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9666"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9666-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,21]]}}}