{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:01:30Z","timestamp":1772283690126,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,10,27]],"date-time":"2010-10-27T00:00:00Z","timestamp":1288137600000},"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,11]]},"DOI":"10.1007\/s10623-010-9444-2","type":"journal-article","created":{"date-parts":[[2010,10,26]],"date-time":"2010-10-26T02:48:34Z","timestamp":1288061314000},"page":"141-150","source":"Crossref","is-referenced-by-count":8,"title":["Binary formally self-dual odd codes"],"prefix":"10.1007","volume":"61","author":[{"given":"Sunghyu","family":"Han","sequence":"first","affiliation":[]},{"given":"Heisook","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Yoonjin","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,10,27]]},"reference":[{"key":"9444_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1023\/A:1011203416769","volume":"23","author":"K. Betsumiya","year":"2001","unstructured":"Betsumiya K., Harada M.: Binary optimal odd formally self-dual codes. Des. Codes Cryptogr. 23, 11\u201321 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"9444_CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1023\/A:1011223128089","volume":"23","author":"K. Betsumiya","year":"2001","unstructured":"Betsumiya K., Harada M.: Classification of formally self-dual even codes of lengths up to 16. Des. Codes Cryptogr. 23, 325\u2013332 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"9444_CR3","unstructured":"Cannon J., Playoust C.: An Introduction to Magma. University of Sydney, Sydney, Australia (1994)"},{"key":"9444_CR4","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes. http:\/\/www.codetables.de . Accessed 31 Oct 2008"},{"key":"9444_CR5","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/j.disc.2003.10.027","volume":"283","author":"T.A. Gulliver","year":"2004","unstructured":"Gulliver T.A., \u00d6sterg\u00e5rd P.R.J.: Binary optimal linear rate 1\/2 codes. Discrete Math. 283, 255\u2013261 (2004)","journal-title":"Discrete Math."},{"key":"9444_CR6","unstructured":"Han S.: Database of binary formally self-dual codes. http:\/\/kutacc.kut.ac.kr\/~sunghyu\/data\/bfsd.htm . Accessed 11 Aug 2010."},{"key":"9444_CR7","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/j.ffa.2005.05.012","volume":"11","author":"W.C. Huffman","year":"2005","unstructured":"Huffman W.C.: On the classification and enumeration of self-dual codes. Finite Fields Appl. 11, 451\u2013490 (2005)","journal-title":"Finite Fields Appl."},{"key":"9444_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-correcting Codes","author":"W.C. Huffman","year":"2003","unstructured":"Huffman W.C., Pless V.S.: Fundamentals of Error-correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"9444_CR9","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1023\/A:1019903407222","volume":"27","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd P.R.J.: Classifying subspaces of hamming spaces. Des. Codes Cryptogr. 27, 297\u2013305 (2002)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9444-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-010-9444-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-010-9444-2","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-9444-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,27]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9444"],"URL":"https:\/\/doi.org\/10.1007\/s10623-010-9444-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,27]]}}}