{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:04:37Z","timestamp":1648746277798},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,6,6]],"date-time":"2012-06-06T00:00:00Z","timestamp":1338940800000},"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":[[2014,1]]},"DOI":"10.1007\/s10623-012-9700-8","type":"journal-article","created":{"date-parts":[[2012,6,5]],"date-time":"2012-06-05T19:09:57Z","timestamp":1338923397000},"page":"127-138","source":"Crossref","is-referenced-by-count":3,"title":["Classification and nonexistence results for linear codes with prescribed minimum distances"],"prefix":"10.1007","volume":"70","author":[{"given":"Thomas","family":"Feulner","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,6]]},"reference":[{"key":"9700_CR1","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0097-3165(78)90011-0","volume":"24","author":"M. Barnabei","year":"1978","unstructured":"Barnabei M., Searby D., Zucchini C.: On small (k, q)-arcs in planes of order q 2. J. Combin. Theory Ser. A 24, 241\u2013246 (1978)","journal-title":"J. Combin. Theory Ser. A"},{"key":"9700_CR2","volume-title":"Error-Correcting Linear Codes","author":"A. Betten","year":"2006","unstructured":"Betten A., Braun M., Fripertinger H., Kerber A., Kohnert A., Wassermann A.: Error-Correcting Linear Codes. Springer, Berlin (2006)"},{"key":"9700_CR3","unstructured":"Bosma W., Cannon J. J., Fieker C., Steel A. (eds.): Handbook of Magma Functions, Edition 2.16 (2010)."},{"key":"9700_CR4","doi-asserted-by":"crossref","first-page":"6089","DOI":"10.1109\/TIT.2011.2162264","volume":"57","author":"I.G. Bouyukliev","year":"2011","unstructured":"Bouyukliev I.G., Jacobsson E.: Results on binary linear codes with minimum distance 8 and 10. IEEE Trans. Inform. Theory 57, 6089\u20136093 (2011)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9700_CR5","doi-asserted-by":"crossref","first-page":"1993","DOI":"10.1109\/18.705579","volume":"44","author":"Y. Edel","year":"1998","unstructured":"Edel Y., Bierbrauer J.: Inverting construction Y 1. IEEE Trans. Inform. Theory 44, 1993 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9700_CR6","doi-asserted-by":"crossref","first-page":"363","DOI":"10.3934\/amc.2009.3.363","volume":"3","author":"T. Feulner","year":"2009","unstructured":"Feulner T.: The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes. Adv. Math. Commun. 3, 363\u2013383 (2009)","journal-title":"Adv. Math. Commun."},{"key":"9700_CR7","unstructured":"Feulner T., Nebe G.: The automorphism group of a self-dual binary [72, 36, 16] code does not contain Z 7, Z 3 \u00d7\u00a0 Z 3 or D 10. arXiv:abs\/1110.6012 (2011)."},{"key":"9700_CR8","unstructured":"Grassl M.: Bounds on the minimum distance of linear codes and quantum codes (2012). http:\/\/www.codetables.de . Accessed 22 Feb 2012."},{"key":"9700_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":"9700_CR10","unstructured":"Schmid W., Sch\u00fcrer R.: MinT: A database for optimal net parameters. In: Niederreiter, H., Talay, D. (eds.) Monte Carlo and Quasi-Monte Carlo Methods 2004, pp. 457\u2013469, Springer, Heidelberg (2006). http:\/\/mint.sbg.ac.at\/ . Accessed 22 Feb 2012."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9700-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9700-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9700-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:33Z","timestamp":1559246313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9700-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,6]]},"references-count":10,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["9700"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9700-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,6]]}}}