{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:35:02Z","timestamp":1774370102369,"version":"3.50.1"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"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,6]]},"DOI":"10.1109\/tit.2009.2018338","type":"journal-article","created":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T21:01:44Z","timestamp":1242766904000},"page":"2622-2625","source":"Crossref","is-referenced-by-count":9,"title":["Reconstructing Extended Perfect Binary One-Error-Correcting Codes From Their Minimum Distance Graphs"],"prefix":"10.1109","volume":"55","author":[{"given":"Ivan Yu.","family":"Mogilnykh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patric R. J.","family":"Ostergard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olli","family":"Pottonen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Faina I.","family":"Solov'eva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01237489"},{"key":"ref3","first-page":"3","volume":"5","author":"avgustinovich","year":"1994","journal-title":"Discrete Analysis (Russian)"},{"key":"ref10","first-page":"287","article-title":"an enumeration of 1-perfect binary codes","volume":"21","author":"phelps","year":"2000","journal-title":"Austral J Combin"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/237814.238006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0653(04)00196-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(82)90055-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-04-01626-6"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00356-5"},{"key":"ref9","author":"j stergrd","year":"0","journal-title":"The Perfect Binary One-Error-Correcting Codes of Length 15 Part IClassification"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017150214026"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/4957623\/04957653.pdf?arnumber=4957653","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:03:15Z","timestamp":1633910595000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4957653\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":10,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2009.2018338","relation":{},"ISSN":["0018-9448"],"issn-type":[{"value":"0018-9448","type":"print"}],"subject":[],"published":{"date-parts":[[2009,6]]}}}