{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:34:22Z","timestamp":1775054062626,"version":"3.50.1"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,1,12]],"date-time":"2010-01-12T00:00:00Z","timestamp":1263254400000},"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":[[2010,11]]},"DOI":"10.1007\/s10623-009-9358-z","type":"journal-article","created":{"date-parts":[[2010,1,11]],"date-time":"2010-01-11T02:44:45Z","timestamp":1263177885000},"page":"161-168","source":"Crossref","is-referenced-by-count":1,"title":["On the minimum distance graph of an extended Preparata code"],"prefix":"10.1007","volume":"57","author":[{"given":"C.","family":"Fern\u00e1ndez-C\u00f3rdoba","sequence":"first","affiliation":[]},{"given":"K. T.","family":"Phelps","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,12]]},"reference":[{"key":"9358_CR1","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"E.F. Assmus","year":"1969","unstructured":"Assmus E.F., Mattson H.F. Jr.: New 5-designs. J. Comb. Theory 6, 122\u2013151 (1969)","journal-title":"J. Comb. Theory"},{"key":"9358_CR2","unstructured":"Avgustinonvich S.V.: On isometry of close-packed binary codes, discrete analysis (Russian), Izdat. Ross. Akad. Nauk Sibirsk. Otdel. Inst. Mat., Novosibirsk, pp. 3\u20135, 1994. English translation in Siber. Adv. Math. 5(3), 1\u20134 (1995)."},{"key":"9358_CR3","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0166-218X(00)00356-5","volume":"114","author":"S.V. Avgustinonvich","year":"2001","unstructured":"Avgustinonvich S.V.: Perfect binary (n,3) codes: the structure of graphs of minimum distances. Discr. Appl. Math. 114, 9\u201311 (2001)","journal-title":"Discr. Appl. Math."},{"key":"9358_CR4","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/jcd.3180020307","volume":"2","author":"A.H. Baartmans","year":"1994","unstructured":"Baartmans A.H., Bliskov I., Tonchev V.D.: The Preparata codes and a class of 4-designs. J. Comb. Desi. 2, 167\u2013170 (1994)","journal-title":"J. Comb. Desi."},{"key":"9358_CR5","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Company, NY (1977)"},{"key":"9358_CR6","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1134\/S0032946009020057","volume":"45","author":"I.Y. Mogilnykh","year":"2009","unstructured":"Mogilnykh I.Y.: On weak isometries of Preparata codes. Prob. Inform. Transmis. 45, 145\u2013150 (2009)","journal-title":"Prob. Inform. Transmis."},{"key":"9358_CR7","doi-asserted-by":"crossref","first-page":"2622","DOI":"10.1109\/TIT.2009.2018338","volume":"55","author":"I.Y. Mogilnykh","year":"2009","unstructured":"Mogilnykh I.Y., \u00d6sterg\u00e5rd P.R.J., Pottonen O., Solov\u2019eva F.I.: Reconstructing extended perfect binary one-error-correcting codes from their minimum distance graphs. IEEE Trans. Inform. Theory 55, 2622\u20132625 (2009)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9358_CR8","unstructured":"\u00d6sterg\u00e5rd P.R.J., Pottonen O.: The perfect binary one-error correcting codes of length 15-part I: classification (submitted for publication)."},{"key":"9358_CR9","first-page":"287","volume":"21","author":"K.T. Phelps","year":"2000","unstructured":"Phelps K.T.: An enumeration of 1-perfect binary codes. Aust. J. Comb. 21, 287\u2013298 (2000)","journal-title":"Aust. J. Comb."},{"key":"9358_CR10","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1023\/A:1017150214026","volume":"16","author":"K.T. Phelps","year":"1999","unstructured":"Phelps K.T., LeVan M.: Switching classes of perfect codes. Des. Codes Cryptogr. 16, 179\u2013184 (1999)","journal-title":"Des. Codes Cryptogr."},{"key":"9358_CR11","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/S0019-9958(68)90874-7","volume":"13","author":"F.P. Preparata","year":"1968","unstructured":"Preparata F.P.: A class of optimum nonlinear double-error correcting codes. Inform. Control 13, 378\u2013400 (1968)","journal-title":"Inform. Control"},{"issue":"1","key":"9358_CR12","first-page":"38","volume":"7","author":"N.V. Semakio","year":"1971","unstructured":"Semakio N.V., Zinoviev V.A., Zaitsev G.V.: Uniformly packed codes. Prob. Inform. Transmis. 7(1), 38\u201350 (1971)","journal-title":"Prob. Inform. Transmis."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9358-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9358-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9358-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:27Z","timestamp":1559246307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9358-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,12]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9358"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9358-z","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,12]]}}}