{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,17]],"date-time":"2024-05-17T18:54:00Z","timestamp":1715972040197},"reference-count":17,"publisher":"Elsevier BV","issue":"9","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":1538,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1016\/j.disc.2008.06.037","type":"journal-article","created":{"date-parts":[[2008,8,6]],"date-time":"2008-08-06T08:11:53Z","timestamp":1218010313000},"page":"2763-2774","source":"Crossref","is-referenced-by-count":1,"title":["On rank and kernel of some mixed perfect codes"],"prefix":"10.1016","volume":"309","author":[{"given":"Fabio","family":"Pasticci","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Westerb\u00e4ck","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.disc.2008.06.037_b1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/B:PRIT.0000011272.10614.8c","article-title":"On the ranks and kernel problem for perfect codes","volume":"39","author":"Avgustinovich","year":"2003","journal-title":"Problems of Information Transmission"},{"issue":"3","key":"10.1016\/j.disc.2008.06.037_b2","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/B:DESI.0000015891.01562.c1","article-title":"The classification of some perfect codes","volume":"31","author":"Avgustinovich","year":"2004","journal-title":"Designs, Codes and Cryptography"},{"key":"10.1016\/j.disc.2008.06.037_b3","first-page":"181","article-title":"Every equidistant linear code is a sequence of dual Hamming codes","volume":"18","author":"Bonisoli","year":"1984","journal-title":"Ars Combinatoria"},{"issue":"2","key":"10.1016\/j.disc.2008.06.037_b4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/S0895480196309171","article-title":"On perfect codes and tilings: Problems and solutions","volume":"11","author":"Etzion","year":"1998","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"1","key":"10.1016\/j.disc.2008.06.037_b5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10623-005-5665-1","article-title":"A full rank perfect code of length 31","volume":"38","author":"Heden","year":"2006","journal-title":"Designs, Codes and Cryptography"},{"issue":"4","key":"10.1016\/j.disc.2008.06.037_b6","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/S0019-9958(77)90372-2","article-title":"A new construction of group and nongroup perfect codes","volume":"34","author":"Heden","year":"1977","journal-title":"Information and Control"},{"key":"10.1016\/j.disc.2008.06.037_b7","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0012-365X(02)00391-6","article-title":"On the reconstruction of perfect codes","volume":"256","author":"Heden","year":"2002","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.disc.2008.06.037_b8","unstructured":"O. Heden, On tilings with different perfect codes (submitted for publication)"},{"issue":"2","key":"10.1016\/j.disc.2008.06.037_b9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.4153\/CMB-1972-038-x","article-title":"Group partition, factorization and the vector covering problem","volume":"15","author":"Herzog","year":"1972","journal-title":"Canadian Mathematical Bulletin"},{"issue":"1","key":"10.1016\/j.disc.2008.06.037_b10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4153\/CMB-1975-011-2","article-title":"Group partitions and mixed perfect codes","volume":"18","author":"Lindstr\u00f6m","year":"1975","journal-title":"Canadian Mathematical Bulletin"},{"issue":"3","key":"10.1016\/j.disc.2008.06.037_b11","doi-asserted-by":"crossref","first-page":"1147","DOI":"10.1109\/TVT.2005.844659","article-title":"Assignment of frequency lists in frequency hopping networks","volume":"54","author":"Moon","year":"2005","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"2","key":"10.1016\/j.disc.2008.06.037_b12","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1137\/S0895480104435804","article-title":"Resolving the existence of full-rank tilings of binary Hamming spaces","volume":"18","author":"\u00d6sterg\u00e5rd","year":"2005","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"10.1016\/j.disc.2008.06.037_b13","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/A:1019936019517","article-title":"On perfect codes: Rank and kernel","volume":"27","author":"Phelps","year":"2002","journal-title":"Design, Codes and Cryptography"},{"key":"10.1016\/j.disc.2008.06.037_b14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1147\/rd.31.0025","article-title":"On the mathematical theory of error correcting codes","volume":"3","author":"Shapiro","year":"1959","journal-title":"IBM Journal of Research Development"},{"key":"10.1016\/j.disc.2008.06.037_b15","series-title":"The Theory of Error-Correcting Codes","author":"Sloane","year":"1977"},{"key":"10.1016\/j.disc.2008.06.037_b16","unstructured":"F.I. Solov\u2019eva, On Perfect Codes and Related Topics, in: Com2Mac Lecture Note Series, vol. 13, Pohang, 2004"},{"issue":"3","key":"10.1016\/j.disc.2008.06.037_b17","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1137\/S0895480102410213","article-title":"Full-Rank tilings of F28 do not exist","volume":"16","author":"Trachtenberg","year":"2003","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X08004317?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X08004317?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,12,26]],"date-time":"2018-12-26T18:21:10Z","timestamp":1545848470000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X08004317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":17,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["S0012365X08004317"],"URL":"https:\/\/doi.org\/10.1016\/j.disc.2008.06.037","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}