{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T05:52:25Z","timestamp":1770357145102,"version":"3.49.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1007\/bf01388559","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T08:33:07Z","timestamp":1112430787000},"page":"43-55","source":"Crossref","is-referenced-by-count":44,"title":["On designs and formally self-dual codes"],"prefix":"10.1007","volume":"4","author":[{"given":"George T.","family":"Kennedy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera","family":"Pless","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6A","author":"E.F. Assmus Jr.","year":"1969","unstructured":"Assmus, Jr., E.F. and Mattson, Jr., H.F. 1969. New 5-designs.J. Combin. Theory. 6A: 122?151.","journal-title":"J. Combin. Theory"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"Brualdi, R.A. and Pless, V. 1993. Greedy codes. To appearJ. Combin. Theory SerA.","DOI":"10.1016\/0097-3165(93)90085-M"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/0097-3165(80)90057-6","volume":"28A","author":"J.H. Conway","year":"1980","unstructured":"Conway, J.H. and Pless, V. 1980. On the enumeration of self-dual codes.J. Combin. Theory, 28A: 26?53.","journal-title":"J. Combin. Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0097-3165(92)90003-D","volume":"60A","author":"J.H. Conway","year":"1992","unstructured":"Conway, J.H., Pless, V., and Sloane, N.J.A. 1992. The binary self-dual codes of length up to 32: a revised enumeration.J. Combin. Theory. 60A:183?195.","journal-title":"J. Combin. Theory"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1109\/18.59931","volume":"36","author":"J.H. Conway","year":"1990","unstructured":"Conway, J.H. and Sloane, N.J.A. 1990. New upper bounds on minimal distance of self-dual codes.IEEE Trans. Inform. Theory. IT-36:1319?1333.","journal-title":"IEEE Trans. Inform. Theory."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1109\/TIT.1979.1056047","volume":"25","author":"J.H. Conway","year":"1979","unstructured":"Conway, J.H., Pless, V., and Sloane, N.J.A. 1979. Self-dual codes over GF(3) and GF(4) of length not exceeding 16.IEEE Trans. Inform. Theory. IT-25:312?322.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1016\/S0019-9958(71)90428-1","volume":"18","author":"P. Delsarte","year":"1971","unstructured":"Delsarte, P. 1971. Majority logic decodable codes derived from finite inversive planes.Inform. Contr. 18: 318?325.","journal-title":"Inform. Contr."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"730","DOI":"10.1109\/TIT.1978.1055965","volume":"24","author":"J.H. Lint van","year":"1978","unstructured":"van Lint, J.H. and MacWilliams, F.J. 1978. Generalized quadratic residue codes.IEEE Trans. Inform. Theory. IT-24:730?737.","journal-title":"IEEE Trans. Inform. Theory."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/0097-3165(78)90021-3","volume":"25A","author":"F.J. MacWilliams","year":"1978","unstructured":"MacWilliams, F.J., Odlyzko, A.M., Sloane, N.J.A., and Ward, H.N. 1978. Self-dual codes over GF(4).J. Combin. Theory. 25A:288?318.","journal-title":"J. Combin. Theory."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/S0019-9958(73)90273-8","volume":"22","author":"C.L. Mallows","year":"1973","unstructured":"Mallows, C.L. and Sloane, N.J.A. 1973. An upper bound for self-dual codes.Inform. Contr. 22: 188?200.","journal-title":"Inform. Contr."},{"key":"CR11","volume-title":"Error Correcting Codes","author":"W.W. Peterson","year":"1972","unstructured":"Peterson, W.W. and Weldon, E.J. 1972.Error Correcting Codes, 2nd edition. Cambridge, Mass.: MIT Press.","edition":"2nd edition"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(72)90034-9","volume":"3","author":"V. Pless","year":"1972","unstructured":"Pless, V. 1972. A classification of self-orthogonal codes over GF(2).Discrete Math. 3:209?246.","journal-title":"Discrete Math."},{"key":"CR13","volume-title":"The Theory of Error Correcting Codes","author":"V. Pless","year":"1989","unstructured":"Pless, V. 1989.The Theory of Error Correcting Codes, 2nd edition. New York: John Wiley and Sons.","edition":"2nd edition"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0097-3165(75)90042-4","volume":"18A","author":"V. Pless","year":"1975","unstructured":"Pless, V. and Sloane, N.J.A. 1975. On the classification and enumeration of self-dual codes.J. Combin. Theory. 18A:313?335.","journal-title":"J. Combin. Theory"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1016\/0097-3165(87)90056-2","volume":"44A","author":"V. Pless","year":"1987","unstructured":"Pless, V., Masley, J.M., and Leon, J.S. 1987. On weights in duadic codes.J. Combin. Theory. 44A:6?21.","journal-title":"J. Combin. Theory."},{"key":"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. 1979. Self-dual codes and lattices.Proc. Symp. Pure Math. 34:273?308.","journal-title":"Proc. Symp. Pure Math."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/0012-365X(92)90574-Y","volume":"106\/107","author":"J. Simonis","year":"1992","unstructured":"Simonis, J. 1992. The [18, 9, 6] code is unique.Discrete Math. 106\/107:439?448.","journal-title":"Discrete Math."},{"key":"CR18","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TIT.1987.1057356","volume":"33","author":"T. Verhoeff","year":"1987","unstructured":"Verhoeff, T. 1987. An updated table of minimum distance bounds for binary linear codes.IEEE Trans. Inform. Theory. IT-33:665?680.","journal-title":"IEEE Trans. Inform. Theory."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0097-3165(76)90071-6","volume":"21A","author":"H.N. Ward","year":"1976","unstructured":"Ward, H.N. 1976. A restriction on the weight enumerator of a self-dual code.J. Combin. Theory. 21A:253?255.","journal-title":"J. Combin. Theory."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388559\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388559.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01388559\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01388559","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T16:32:24Z","timestamp":1586190744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01388559"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF01388559"],"URL":"https:\/\/doi.org\/10.1007\/bf01388559","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}