{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,5,1]],"date-time":"2022-05-01T04:13:02Z","timestamp":1651378382043},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T00:00:00Z","timestamp":1379548800000},"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":[[2015,3]]},"DOI":"10.1007\/s10623-013-9874-8","type":"journal-article","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T07:49:12Z","timestamp":1379490552000},"page":"571-579","source":"Crossref","is-referenced-by-count":3,"title":["Classification of self-dual codes of length 50 with an automorphism of odd prime order"],"prefix":"10.1007","volume":"74","author":[{"given":"Nikolay","family":"Yankov","sequence":"first","affiliation":[]},{"given":"Moon Ho","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,9,19]]},"reference":[{"key":"9874_CR1","unstructured":"Bouyukliev I.: About the Code Equivalence, Advances in Coding Theory and Cryptography. Series on Coding Theory and Cryptology, vol. 3. World Scientific Publishing, Singapore (2007)."},{"key":"9874_CR2","unstructured":"Bouyuklieva S., Bouyukliev I.: An algorithm for classification of binary self-dual codes. IEEE Trans. Inf. Theory 58(6), 3933\u20133940 (2012)."},{"key":"9874_CR3","doi-asserted-by":"crossref","unstructured":"Bouyuklieva S., Harada M.: Extremal self-dual codes with automorphisms of order 3 and quasi-symmetric 2-(49, 9, 6) designs. Des. Codes Cryptogr. 28(2), 163\u2013169 (2003).","DOI":"10.1023\/A:1022588407585"},{"key":"9874_CR4","doi-asserted-by":"crossref","unstructured":"Bouyuklieva S., Yankov N., Kim J.L.: Classification of binary self-dual [48, 24, 10] codes with an automorphism of odd prime order. Finite Fields Appl. 18(6), 1104\u20131113 (2012).","DOI":"10.1016\/j.ffa.2012.08.002"},{"key":"9874_CR5","doi-asserted-by":"crossref","unstructured":"Bouyuklieva S., Yankov N., Russeva R.: Classification of the binary self-dual [42, 21, 8] codes having an automorphism of order 3. Finite Fields Appl. 13, 605\u2013615 (2007).","DOI":"10.1016\/j.ffa.2006.01.001"},{"key":"9874_CR6","unstructured":"Bouyuklieva S., Yankov N., Russeva R.: On the classification of binary self-dual [44, 22, 8] codes with an automorphism of order 3 or 7. Int. J. Inf. Coding Theory 2(1), 21\u201337 (2011)."},{"key":"9874_CR7","unstructured":"Conway J.H., Pless V., Sloane N.J.A.: Self-dual codes over GF(3) and GF(4) of length not exceeding 16. IEEE Trans. Inf. Theory 25(3), 312\u2013322 (1979)."},{"key":"9874_CR8","doi-asserted-by":"crossref","unstructured":"Harada M., Gulliver T., Kaneta H.: Classification of extremal double-circulant self-dual codes of length up to 62. Discret. Math. 188(1\u20133), 127\u2013136 (1998).","DOI":"10.1016\/S0012-365X(97)00250-1"},{"key":"9874_CR9","unstructured":"Harada M., Munemasa A.: Some restrictions on weight enumerators of singly even self-dual codes. IEEE Trans. Inf. Theory 52(3), 1266\u20131269 (2006)."},{"key":"9874_CR10","unstructured":"Huffman W.C.: Automorphisms of codes with applications to extremal doubly even codes of length 48. IEEE Trans. Inf. Theory 28(3), 511\u2013521 (1982)."},{"key":"9874_CR11","doi-asserted-by":"crossref","unstructured":"Huffman W.C.: On the classification and enumeration of self-dual codes. Finite Fields Appl. 11(3), 451\u2013490 (2005).","DOI":"10.1016\/j.ffa.2005.05.012"},{"key":"9874_CR12","doi-asserted-by":"crossref","unstructured":"Huffman W.C., Tonchev V.D.: The existence of extremal self-dual [50, 25, 10] codes and quasi-symmetric 2-(49, 9, 6) designs. Des. Codes Cryptogr. 6(2), 97\u2013106 (1995).","DOI":"10.1007\/BF01398008"},{"key":"9874_CR13","doi-asserted-by":"crossref","unstructured":"Kim H.J.: The binary extremal self-dual codes of lengths 38 and 40. Des. Codes Cryptogr. 63(1), 43\u201357 (2012).","DOI":"10.1007\/s10623-011-9534-9"},{"key":"9874_CR14","unstructured":"MacWilliams F., Odlyzko A., Sloane N., Ward H.: Self-dual codes over GF(4). J. Comb. Theory Ser. A 25(3), 288\u2013318 (1978)."},{"key":"9874_CR15","unstructured":"Pless V.: A classification of self-orthogonal codes over GF(2). Discret. Math. 3, 209\u2013246 (1972)."},{"key":"9874_CR16","unstructured":"Pless V., Sloane N.: On the classification and enumeration of self-dual codes. J. Comb. Theory Ser. A 18(3), 313\u2013335 (1975)."},{"key":"9874_CR17","unstructured":"Rains E., Sloane N.: Self-dual codes. In: Pless V.S., Huffman W.C., editors. Handbook of Coding Theory. Amsterdam: Elsevier; (1998)."},{"key":"9874_CR18","doi-asserted-by":"crossref","unstructured":"Yankov N., Lee M.H.: New binary self-dual codes of lengths 50\u201360. Des. Codes Cryptogr. (2013).","DOI":"10.1007\/s10623-013-9839-y"},{"key":"9874_CR19","unstructured":"Yorgov V.: A method for constructing inequivalent self-dual codes with applications to length 56. IEEE Trans. Inf. Theory 33(1), 77\u201382 (1987)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9874-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9874-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9874-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T05:18:47Z","timestamp":1563945527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9874-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,19]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["9874"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9874-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,19]]}}}  <script>parent.window.postMessage('ixistenz.url:https://api.crossref.org/works/10.1007%2FS10623-013-9874-8', '*'); </script> <div id='browserdiffcontainer' style='position: fixed; right: 10px; top: 10vh; min-width: 60px;  border: 1px solid white; background: rgb(251, 189, 0);; opacity: 0.9; font-family: helvetica, arial, sans serif;  font-size: 12px; z-index: 20001; padding-bottom: 20px;'><div onclick="toggle('browserdiffcontainerlist'); return false;" style='background: rgb(151, 89, 0);; color: white; '><strong>&nbsp; <span class='glyphicon glyphicon-minus'></span> NODES</strong></div><div id='browserdiffcontainerlist' style='padding-left: 10px; padding-right: 5px; max-height: 50vh; overflow: auto; '></div></div>
<script>
function toggle( divname ) {
  var x = document.getElementById( divname );
  if (x.style.display === 'none') {
    x.style.display = 'block';
  } else {
    x.style.display = 'none';
  }
} </script>