{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:30Z","timestamp":1772283570314,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T00:00:00Z","timestamp":1194912000000},"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":[[2008,1]]},"DOI":"10.1007\/s10623-007-9133-y","type":"journal-article","created":{"date-parts":[[2007,11,12]],"date-time":"2007-11-12T19:54:50Z","timestamp":1194897290000},"page":"45-56","source":"Crossref","is-referenced-by-count":8,"title":["On perfect p-ary codes of length p\u00a0+\u00a01"],"prefix":"10.1007","volume":"46","author":[{"given":"Olof","family":"Heden","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,13]]},"reference":[{"issue":"3","key":"9133_CR1","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/TIT.1983.1056677","volume":"29","author":"M.R. Best","year":"1983","unstructured":"Best M.R. (1983). Perfect codes hardly exist. IEEE Trans. Inform. Theory 29(3): 349\u2013351","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9133_CR2","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1016\/0097-3165(84)90010-4","volume":"36","author":"A. Blokhuis","year":"1984","unstructured":"Blokhuis A., Lam C.W.H. (1984). More coverings by rook domains. J. Combin. Theory Ser. A 36: 240\u2013244","journal-title":"J. Combin. Theory Ser. A"},{"issue":"3","key":"9133_CR3","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/S0895480194277903","volume":"9","author":"T. Etzion","year":"1996","unstructured":"Etzion T. (1996). Nonequivalent q-ary perfect codes. SIAM J. Discrete Math. 9(3): 413\u2013423","journal-title":"SIAM J. Discrete Math."},{"key":"9133_CR4","doi-asserted-by":"crossref","unstructured":"Golay M.J.E.: Notes on digital coding. Proc. IRE 37 (1949), Correspondence 657.","DOI":"10.1109\/JRPROC.1949.233620"},{"key":"9133_CR5","doi-asserted-by":"crossref","unstructured":"Hamming, Error detecting and error correcting codes. Bell Syst. Tech. J. 29, 147\u2013160 (1950).","DOI":"10.1002\/j.1538-7305.1950.tb00463.x"},{"key":"9133_CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.7146\/math.scand.a-11583","volume":"37","author":"O. Heden","year":"1975","unstructured":"Heden O. (1975). A generalised Lloyd Theorem and mixed perfect codes. Math. Scand. 37: 13\u201326","journal-title":"Math. Scand."},{"key":"9133_CR7","doi-asserted-by":"crossref","unstructured":"Heden O.: Perfect codes from the dual point of view I. submitted to Discrete Math.","DOI":"10.1016\/j.disc.2007.11.037"},{"key":"9133_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10623-005-5665-1","volume":"38","author":"O. Heden","year":"2006","unstructured":"Heden O. (2006). A full rank perfect code of length 31. Des. Codes Crypthogr. 38, 125\u2013129","journal-title":"Des. Codes Cryptogr."},{"key":"9133_CR9","volume-title":"Algebra","author":"S. Lang","year":"1965","unstructured":"Lang S. (1965). Algebra. Addison-Wesley Publishing Company, Reading"},{"issue":"2","key":"9133_CR10","first-page":"123","volume":"2","author":"V.K. Leontiev","year":"1973","unstructured":"Leontiev V.K., Zinoviev V.A. (1973). Nonexistence of perfect codes over galois fields. Problems Inform. Theory 2(2): 123\u2013132","journal-title":"Problems Inform. Theory"},{"key":"9133_CR11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.7146\/math.scand.a-10952","volume":"25","author":"B. Lindstr\u00f6m","year":"1969","unstructured":"Lindstr\u00f6m B. (1969). On group and nongroup perfect codes in q symbols. Math. Scand. 25: 149\u2013158","journal-title":"Math. Scand."},{"key":"9133_CR12","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1137\/0604040","volume":"4","author":"K.T. Phelps","year":"1983","unstructured":"Phelps K.T. (1983). A general product construction of perfect codes. SIAM J. Algebra Discrete Method. 4, 224\u2013228","journal-title":"SIAM J. Algebra Discrete Method."},{"issue":"1\u20132","key":"9133_CR13","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1016510804974","volume":"27","author":"K.T. Phelps","year":"2002","unstructured":"Phelps K.T., Villanueva M. (2002). Ranks of q-ary 1-perfect codes. Des. Codes Cryptogr. 27(1\u20132): 139\u2013144","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"9133_CR14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10623-004-3989-x","volume":"37","author":"K.T. Phelps","year":"2005","unstructured":"Phelps K.T., Rif\u00e0 J., Villanueva M. (2005). Kernels and p-kernels of p r -ary 1-perfect codes. Des. Codes Cryptogr. 37(2): 243\u2013261","journal-title":"Des. Codes Cryptogr."},{"key":"9133_CR15","doi-asserted-by":"crossref","unstructured":"R\u00e9dei L.: L\u00fcckenhafte Polynome \u00fcber endlischen K\u00f6rpern. Birkh\u00e4user verlag Basel und Stuttgart (1970).","DOI":"10.1007\/978-3-0348-4006-4"},{"key":"9133_CR16","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/S0019-9958(68)90167-8","volume":"12","author":"J. Sch\u00f6nheim","year":"1968","unstructured":"Sch\u00f6nheim J. (1968). On linear and nonlinear single-error-correcting q-ary perfect codes. Inform. Control 12: 23\u201326","journal-title":"Inform. Control"},{"key":"9133_CR17","unstructured":"Solov\u2019eva F.I.: On Perfect Codes and Related Topics. Com2Mac Lecture Note Series 13, Pohang (2004)."},{"key":"9133_CR18","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1137\/0124010","volume":"24","author":"A. Tiet\u00e4v\u00e4inen","year":"1973","unstructured":"Tiet\u00e4v\u00e4inen A. (1973). On the nonexistence of perfect codes over finite fields. SIAM J. Appl. Math. 24, 88\u201396","journal-title":"SIAM J. Appl. Math."},{"key":"9133_CR19","volume-title":"Algebra, Erster Teil, Siebte Auflage der Modernen Algebra","author":"B.L. Waerden van der","year":"1966","unstructured":"van der Waerden B.L. (1966). Algebra, Erster Teil, Siebte Auflage der Modernen Algebra. Springer-Verlag, Berlin"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9133-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-007-9133-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-007-9133-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:08Z","timestamp":1559245808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-007-9133-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,13]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["9133"],"URL":"https:\/\/doi.org\/10.1007\/s10623-007-9133-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,13]]}}}