{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T15:35:08Z","timestamp":1726760108733},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,10,22]],"date-time":"2014-10-22T00:00:00Z","timestamp":1413936000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2014,12]]},"DOI":"10.1007\/s11704-014-3469-z","type":"journal-article","created":{"date-parts":[[2014,10,22]],"date-time":"2014-10-22T06:09:52Z","timestamp":1413958192000},"page":"1024-1031","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal binary codes and binary construction of quantum codes"],"prefix":"10.1007","volume":"8","author":[{"given":"Weiliang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yangyu","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruihu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,22]]},"reference":[{"key":"3469_CR1","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C E Shannon","year":"1948","unstructured":"Shannon C E. A mathematical theory of communication. Bell System Technical Journal, 1948, 27: 379\u2013423, 623\u2013656","journal-title":"Bell System Technical Journal"},{"key":"3469_CR2","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, 2003"},{"key":"3469_CR3","unstructured":"Grassl M. Code tables: bounds on the parameters of various types of codes. http:\/\/www.codetables.de\/"},{"key":"3469_CR4","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"P W Shor","year":"1995","unstructured":"Shor P W. Scheme for reducing decoherence in quantum computer memory. Physical Review A, 1995, 52: 2493\u20132496","journal-title":"Physical Review A"},{"key":"3469_CR5","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1103\/PhysRevLett.77.793","volume":"77","author":"A M Steane","year":"1996","unstructured":"Steane A M. Error correcting codes in quantum theory. Physical Review Letters, 1996, 77: 793\u2013797","journal-title":"Physical Review Letters"},{"key":"3469_CR6","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","volume":"54","author":"A R Calderbank","year":"1996","unstructured":"Calderbank A R, Shor P W. Good quantum error-correcting codes exist. Physical Review A, 1996, 54: 1098\u20131105","journal-title":"Physical Review A"},{"key":"3469_CR7","doi-asserted-by":"crossref","first-page":"2492","DOI":"10.1109\/18.796388","volume":"45","author":"A M Steane","year":"1999","unstructured":"Steane A M. Enlargement of calderbank-shor-steane quantum codes. IEEE Transactions on Information Theory, 1999, 45: 2492\u20132495","journal-title":"IEEE Transactions on Information Theory"},{"key":"3469_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.disc.2004.06.010","volume":"287","author":"S Bouyuklieva","year":"2004","unstructured":"Bouyuklieva S. Some optimal self-orthogonal and self-dual codes. Discrete Mathematics, 2004, 287: 1\u201310","journal-title":"Discrete Mathematics"},{"issue":"5","key":"3469_CR9","doi-asserted-by":"crossref","first-page":"2091","DOI":"10.1109\/TIT.2010.2043763","volume":"56","author":"S Bouyuklieva","year":"2010","unstructured":"Bouyuklieva S, Anton M, Wolfgang W. Automorphisms of extremal codes. IEEE Transactions on Information Theory, 2010, 56(5): 2091\u20132096","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"3469_CR10","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s10623-006-0018-2","volume":"41","author":"S Bouyuklieva","year":"2006","unstructured":"Bouyuklieva S, Ostergard P R J. New constructions of optimal self-dual binary codes of length 54. Designs, Codes and Cryptography, 2006, 41(1): 101\u2013109","journal-title":"Designs, Codes and Cryptography"},{"key":"3469_CR11","first-page":"173","volume":"59","author":"RT Bilous","year":"2006","unstructured":"Bilous R.T. Enumeration of the binary self-dual codes of length 34. Journal of Combinatorial Mathematics and Combinatorial Computing, 2006, 59: 173\u2013211","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"issue":"2","key":"3469_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.3934\/amc.2012.6.229","volume":"6","author":"M Harada","year":"2012","unstructured":"Harada M, Munemasa A. Classification of self-dual codes of length 36. Advances in Mathematics of Communications, 2012, 6(2): 229\u2013235","journal-title":"Advances in Mathematics of Communications"},{"issue":"6","key":"3469_CR13","doi-asserted-by":"crossref","first-page":"3933","DOI":"10.1109\/TIT.2012.2190134","volume":"58","author":"S Bouyuklieva","year":"2012","unstructured":"Bouyuklieva S, Bouyukliev I. An algorithm for classification of binary self-dual codes. IEEE Transactions on Information Theory, 2012, 58(6): 3933\u20133940","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"3469_CR14","doi-asserted-by":"crossref","first-page":"2253","DOI":"10.1109\/TIT.2011.2177809","volume":"58","author":"C Aguilar-Melchor","year":"2012","unstructured":"Aguilar-Melchor C, Gaborit P, Kim J L, Sok L, Sole P, Vega G. Classification of extremal and s-extremal binary self-dual codes of length 38. IEEE Transactions on Information Theory, 2012, 58(4): 2253\u20132262","journal-title":"IEEE Transactions on Information Theory"},{"key":"3469_CR15","volume-title":"A complete classification of doubly even self-dual codes of length 40","author":"K Betsumiya","year":"2013","unstructured":"Betsumiya K, Harada M, Munemasa A. A complete classification of doubly even self-dual codes of length 40. http:\/\/arxiv.org\/abs\/1104.3727v4 , 2013.3"},{"key":"3469_CR16","doi-asserted-by":"crossref","first-page":"1603","DOI":"10.1016\/j.disc.2007.04.016","volume":"308","author":"L Ruihu","year":"2008","unstructured":"Ruihu Li, Xueliang Li. Binary construction of quantum codes of minimum distances five and six. Discrete Mathematics, 2008, 308: 1603\u20131611","journal-title":"Discrete Mathematics"},{"issue":"6","key":"3469_CR17","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1109\/TIT.2004.828149","volume":"50","author":"L Ruihu","year":"2004","unstructured":"Ruihu Li, Xueliang Li. Binary construction of quantum codes of minimum distance three and four. IEEE Transactions on Information Theory, 2004, 50(6): 1331\u20131335","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"3469_CR18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/TIT.1973.1054975","volume":"19","author":"N A J Sloane","year":"1973","unstructured":"Sloane N A J. Is there a (72; 36) d = 16 self-dual code?. IEEE Transactions on Information Theory, 1973, 19(2): 251","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"3469_CR19","doi-asserted-by":"crossref","first-page":"6916","DOI":"10.1109\/TIT.2012.2208176","volume":"58","author":"T Feulner","year":"2012","unstructured":"Feulner T, Nebe G. The automorphism group of a self-dual binary [72; 36; 16] code does not contain Z7, Z3 \u00d7 Z3, or D10. IEEE Transactions on Information Theory, 2012, 58(11): 6916\u20136924","journal-title":"IEEE Transactions on Information Theory"},{"issue":"7","key":"3469_CR20","doi-asserted-by":"crossref","first-page":"4445","DOI":"10.1109\/TIT.2011.2145850","volume":"57","author":"E A O\u2019Brien","year":"2011","unstructured":"O\u2019Brien E A, Willems W. On the automorphism group of a binary selfdual doubly-even [72; 36; 16] code. IEEE Transactions on Information Theory, 2011, 57(7): 4445\u20134451","journal-title":"IEEE Transactions on Information Theory"},{"issue":"11","key":"3469_CR21","doi-asserted-by":"crossref","first-page":"3001","DOI":"10.1109\/TIT.2003.819337","volume":"49","author":"R Daskalov","year":"2003","unstructured":"Daskalov R, Hristov P. New binary one-generator quasi-cyclic codes. IEEE Transactions on Information Theory, 2003, 49(11): 3001\u20133005","journal-title":"IEEE Transactions on Information Theory"},{"issue":"3","key":"3469_CR22","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/TIT.2006.890727","volume":"53","author":"E Z Chen","year":"2007","unstructured":"Chen E Z. New quasi-cyclic codes from simplex codes. IEEE Transactions on Information Theory, 2007, 53(3): 1193\u20131196","journal-title":"IEEE Transactions on Information Theory"},{"key":"3469_CR23","first-page":"2095","volume-title":"Proceedings of the 2005 IEEE International Symposium on Information Theory","author":"M Grassl","year":"2005","unstructured":"Grassl M, White G S. New codes from chains of quasi-cyclic codes. In: Proceedings of the 2005 IEEE International Symposium on Information Theory. 2005, 2095\u20132099"},{"key":"3469_CR24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(00)00350-4","volume":"111","author":"K Lally","year":"2001","unstructured":"Lally K, Fitzpatrick P. Algebraic structure of quasicyclic codes. Discrete Applied Mathematics, 2001, 111: 157\u2013175","journal-title":"Discrete Applied Mathematics"},{"issue":"7","key":"3469_CR25","first-page":"2751","volume":"47","author":"S Ling","year":"2001","unstructured":"Ling S, Sole P. On the algebraic structure of quasi-cyclic codes I: finite fields. 2005 IEEE International Sympium on Information Theory, 2001, 47(7): 2751\u20132759","journal-title":"2005 IEEE International Sympium on Information Theory"},{"key":"3469_CR26","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.ffa.2010.01.001","volume":"16","author":"P L Cayrel","year":"2010","unstructured":"Cayrel P L, Chabot C, Necer A. Quasi-cyclic codes as codes over rings of matrices. Finite Fields and Their Applications, 2010, 16: 100\u2013115","journal-title":"Finite Fields and Their Applications"},{"issue":"1","key":"3469_CR27","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s00200-012-0182-8","volume":"24","author":"Y L Cao","year":"2013","unstructured":"Cao Y L. 1-generator quasi-cyclic codes over finite chain rings. Applicable Algebra in Engineering, Communication and Computing, 2013, 24(1): 53\u201372","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"1","key":"3469_CR28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10623-011-9586-x","volume":"67","author":"Y L Cao","year":"2013","unstructured":"Cao Y L, Gao J. Constructing quasi-cyclic codes from linear algebra theory. Designs, Codes and Cryptography, 2013, 67(1): 59\u201375","journal-title":"Designs, Codes and Cryptography"},{"key":"3469_CR29","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1109\/18.681315","volume":"44","author":"A R Calderbank","year":"1998","unstructured":"Calderbank A R, Rains E M, Shor P W, Sloane N J A. Quantum error correction via codes over GF(4). IEEE Transactions on Information Theory, 1998, 44: 1369\u20131387","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-014-3469-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-014-3469-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-014-3469-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:01:20Z","timestamp":1559408480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-014-3469-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,22]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,12]]}},"alternative-id":["3469"],"URL":"https:\/\/doi.org\/10.1007\/s11704-014-3469-z","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,22]]}}}