{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:08Z","timestamp":1772283668840,"version":"3.50.1"},"reference-count":15,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2009,10,1]],"date-time":"2009-10-01T00:00:00Z","timestamp":1254355200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2009,10]]},"DOI":"10.1109\/tit.2009.2027525","type":"journal-article","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T18:21:31Z","timestamp":1253125291000},"page":"4657-4660","source":"Crossref","is-referenced-by-count":33,"title":["The Perfect Binary One-Error-Correcting Codes of Length <formula formulatype=\"inline\"><tex Notation=\"TeX\">$15$<\/tex><\/formula>: Part I\u2014Classification"],"prefix":"10.1109","volume":"55","author":[{"given":"P.","family":"Ostergard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Pottonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0898"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.749014"},{"key":"ref12","author":"mckay","year":"1990","journal-title":"nauty user s guide (version 1 5)"},{"key":"ref13","first-page":"287","article-title":"an enumeration of 1-perfect binary codes","volume":"21","author":"phelps","year":"2000","journal-title":"Australas J Combin"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018338"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017150214026"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.3934\/amc.2008.2.223"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.335887"},{"key":"ref6","author":"kaski","year":"2006","journal-title":"Classification Algorithms for Codes and Designs"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.917692"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2006.03.017"},{"key":"ref7","author":"stergrd","year":"0","journal-title":"The perfect binary one-error-correcting codes of length 15 Part IIProperties"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s1-27.2.242"},{"key":"ref1","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref9","author":"kaski","year":"2008","journal-title":"Libexact User's Guide Version 1 0"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5238716\/05238744.pdf?arnumber=5238744","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:59:31Z","timestamp":1633910371000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5238744\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":15,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2027525","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10]]}}}