{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,5]],"date-time":"2024-04-05T07:49:09Z","timestamp":1712303349886},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2010,12,30]],"date-time":"2010-12-30T00:00:00Z","timestamp":1293667200000},"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":[[2011,4]]},"DOI":"10.1007\/s10623-010-9450-4","type":"journal-article","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T01:38:01Z","timestamp":1293586681000},"page":"281-285","source":"Crossref","is-referenced-by-count":7,"title":["Two optimal one-error-correcting codes of length 13 that are not doubly shortened perfect codes"],"prefix":"10.1007","volume":"59","author":[{"given":"Patric R. J.","family":"\u00d6sterg\u00e5rd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olli","family":"Pottonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,30]]},"reference":[{"key":"9450_CR1","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1002\/jcd.20207","volume":"17","author":"S.V. Avgustinovich","year":"2009","unstructured":"Avgustinovich S.V., Krotov D.S.: Embedding in a perfect code. J. Combin. Des. 17, 419\u2013423 (2009)","journal-title":"J. Combin. Des."},{"key":"9450_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0012-365X(77)90158-3","volume":"17","author":"M.R. Best","year":"1977","unstructured":"Best M.R., Brouwer A.E.: The triply shortened binary Hamming code is optimal. Discrete Math. 17, 235\u2013245 (1977)","journal-title":"Discrete Math."},{"key":"9450_CR3","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/18.749014","volume":"45","author":"T. Blackmore","year":"1999","unstructured":"Blackmore T.: Every binary $${(2^m-2,2^{2^m-2-m},3)}$$ code can be lengthened to form a perfect code of length 2 m \u2212 1. IEEE Trans. Inform. Theory 45, 698\u2013700 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9450_CR4","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1109\/18.335887","volume":"40","author":"T. Etzion","year":"1994","unstructured":"Etzion T., Vardy A.: Perfect binary codes: constructions, properties, and enumeration. IEEE Trans. Inform. Theory 40, 754\u2013763 (1994)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9450_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/S0895480196309171","volume":"11","author":"T. Etzion","year":"1998","unstructured":"Etzion T., Vardy A.: On perfect codes and tilings: problems and solutions. SIAM J. Discrete Math. 11, 205\u2013223 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"9450_CR6","unstructured":"Kaski P., Pottonen O.: libexact user\u2019s guide, version 1.0. Technical Report HIIT TR 2008-1, Helsinki Institute for Information Technology HIIT, Helsinki (2008)."},{"key":"9450_CR7","doi-asserted-by":"crossref","first-page":"4657","DOI":"10.1109\/TIT.2009.2027525","volume":"55","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2009","unstructured":"\u00d6sterg\u00e5rd P.R.J., Pottonen O.: The perfect binary one-error-correcting codes of length 15: Part I\u2014Classification. IEEE Trans. Inform. Theory 55, 4657\u20134660 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9450_CR8","doi-asserted-by":"crossref","first-page":"2571","DOI":"10.1109\/TIT.2010.2046197","volume":"56","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2010","unstructured":"\u00d6sterg\u00e5rd P.R.J., Pottonen O., Phelps K.T.: The perfect binary one-error-correcting codes of length 15: Part II\u2014Properties. IEEE Trans. Inform. Theory 56, 2571\u20132582 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9450_CR9","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01388478","volume":"6","author":"K.T. Phelps","year":"1995","unstructured":"Phelps K.T., LeVan M.: Kernels of nonlinear Hamming codes. Des. Codes Cryptogr. 6, 247\u2013257 (1995)","journal-title":"Des. Codes Cryptogr."},{"key":"9450_CR10","first-page":"66","volume":"47","author":"F.I. Solov\u2019eva","year":"1988","unstructured":"Solov\u2019eva F.I.: Factorization of code-generating disjunctive normal forms (in Russian). Metody Diskret. Analiz. 47, 66\u201388 (1988)","journal-title":"Metody Diskret. Analiz."},{"key":"9450_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/S0166-218X(00)00352-8","volume":"111","author":"F.I. Solov\u2019eva","year":"2001","unstructured":"Solov\u2019eva F.I.: Structure of i-components of perfect binary codes. Discrete Appl. Math. 111, 189\u2013197 (2001)","journal-title":"Discrete Appl. Math."},{"key":"9450_CR12","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9450-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9450-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9450-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:29Z","timestamp":1559231909000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-010-9450-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,30]]},"references-count":12,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9450"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9450-4","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,30]]}}}