{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:06:13Z","timestamp":1767236773494},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,4]],"date-time":"2008-11-04T00:00:00Z","timestamp":1225756800000},"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":[[2009,4]]},"DOI":"10.1007\/s10623-008-9244-0","type":"journal-article","created":{"date-parts":[[2008,11,3]],"date-time":"2008-11-03T18:28:47Z","timestamp":1225736927000},"page":"69-77","source":"Crossref","is-referenced-by-count":9,"title":["The nonexistence of near-extremal formally self-dual codes"],"prefix":"10.1007","volume":"51","author":[{"given":"Sunghyu","family":"Han","sequence":"first","affiliation":[]},{"given":"Jon-Lark","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,4]]},"reference":[{"key":"9244_CR1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316529836","volume-title":"Designs and Their Codes","author":"E.F. Assmus Jr.","year":"1992","unstructured":"Assmus E.F. Jr., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992)"},{"key":"9244_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-6568-7","volume-title":"Sphere Packings, Lattices and Groups","author":"J.H. Conway","year":"1999","unstructured":"Conway J.H., Sloane N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, New York (1999)","edition":"3"},{"key":"9244_CR3","doi-asserted-by":"crossref","unstructured":"Ebelin W.: Lattices and Codes. Friedrich Vieweg and Sohn Verlag (2002).","DOI":"10.1007\/978-3-322-90014-2"},{"key":"9244_CR4","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes. Online available at http:\/\/www.codetables.de . Accessed on 2008-02-06."},{"key":"9244_CR5","unstructured":"Han S., Kim J.-L.: Formally self-dual additive codes over $${\\mathbb F_4}$$ (preprint)."},{"key":"9244_CR6","doi-asserted-by":"crossref","first-page":"1031","DOI":"10.1016\/j.dam.2006.11.004","volume":"155","author":"S. Han","year":"2007","unstructured":"Han S., Lee J.B.: Nonexistence of near-extremal formally self-dual even codes of length divisible by 8. Discrete Appl. Math. 155, 1031\u20131037 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9244_CR7","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00208-003-0440-y","volume":"327","author":"G. H\u00f6hn","year":"2003","unstructured":"H\u00f6hn G.: Self-dual codes over the Kleinian four group. Math. Ann. 327, 227\u2013255 (2003)","journal-title":"Math. Ann."},{"key":"9244_CR8","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":"9244_CR9","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.: Fundamentals of Error-correcting Codes. Cambridge University Press, Cambridge (2003)"},{"key":"9244_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01388559","volume":"4","author":"G.T. Kennedy","year":"1994","unstructured":"Kennedy G.T., Pless V.: On designs and formally self-dual codes. Des. Codes Cryptogr. 4, 43\u201355 (1994)","journal-title":"Des. Codes Cryptogr."},{"key":"9244_CR11","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/0021-8693(75)90155-6","volume":"36","author":"C.L. Mallows","year":"1975","unstructured":"Mallows C.L., Odlyzko A.M., Sloane N.J.A.: Upper bounds for modular forms, lattices, and codes. J. Algebra 36, 68\u201376 (1975)","journal-title":"J. Algebra"},{"key":"9244_CR12","volume-title":"Self-dual Codes and Invariant Theory","author":"G. Nebe","year":"2006","unstructured":"Nebe G., Rains E.M., Sloane N.J.A.: Self-dual Codes and Invariant Theory. Springer, Berlin (2006)"},{"key":"9244_CR13","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0019-9958(73)90862-0","volume":"23","author":"V. Pless","year":"1973","unstructured":"Pless V., Pierce J.N.: Self-dual codes over GF(q) satisfy a modified Varshamov-Gilbert bound. Inform. Control. 23, 35\u201340 (1973)","journal-title":"Inform. Control."},{"key":"9244_CR14","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1109\/18.651000","volume":"44","author":"E.M. Rains","year":"1998","unstructured":"Rains E.M.: Shadow bounds for self-dual codes. IEEE Trans. Inform. Theory 44, 134\u2013139 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9244_CR15","volume-title":"Handbook of Coding Theory","author":"E.M. Rains","year":"1998","unstructured":"Rains E.M., Sloane N.J.A.: Self-dual codes. In: Pless, V.S., Huffman, W.C. (eds) Handbook of Coding Theory, Elsevier, Amsterdam (1998)"},{"key":"9244_CR16","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1090\/pspum\/034\/525331","volume":"34","author":"N.J.A. Sloane","year":"1979","unstructured":"Sloane N.J.A.: Self-dual codes and lattices. Proc. Symp. Pure Math. 34, 273\u2013308 (1979)","journal-title":"Proc. Symp. Pure Math."},{"key":"9244_CR17","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/S0166-218X(98)00131-0","volume":"91","author":"S. Zhang","year":"1999","unstructured":"Zhang S.: On the nonexistence of extremal self-dual codes. Discrete Appl. Math. 91, 277\u2013286 (1999)","journal-title":"Discrete Appl. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9244-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-008-9244-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-008-9244-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:50:10Z","timestamp":1559245810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-008-9244-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,4]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,4]]}},"alternative-id":["9244"],"URL":"https:\/\/doi.org\/10.1007\/s10623-008-9244-0","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,4]]}}}