{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:02:49Z","timestamp":1742983369665,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319266251"},{"type":"electronic","value":"9783319266268"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-26626-8_38","type":"book-chapter","created":{"date-parts":[[2015,12,9]],"date-time":"2015-12-09T09:08:43Z","timestamp":1449652123000},"page":"521-536","source":"Crossref","is-referenced-by-count":0,"title":["Searching for (near) Optimal Codes"],"prefix":"10.1007","author":[{"given":"Xueliang","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaping","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Meiqin","family":"Wei","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":[[2015,12,9]]},"reference":[{"key":"38_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1023\/A:1011203416769","volume":"23","author":"K Betsumiya","year":"2001","unstructured":"Betsumiya, K., Harada, M.: Binary optimal odd formally self-dual codes. Des. Codes Cryptogr. 23, 11\u201321 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"38_CR2","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1023\/A:1011223128089","volume":"23","author":"K Betsumiya","year":"2001","unstructured":"Betsumiya, K., Harada, M.: Classification of formally self-dual even codes of lengths up to 16. Des. Codes Cryptogr. 23, 325\u2013332 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"JC Bermond","year":"1995","unstructured":"Bermond, J.C., Comellas, F., Hsu, D.F.: Distributed loop computer networks: a survey. J. Parallel Distribut. Comput. 24, 2\u201310 (1995)","journal-title":"J. Parallel Distribut. Comput."},{"key":"38_CR4","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1109\/TCS.1985.1085667","volume":"32","author":"FT Boesch","year":"1985","unstructured":"Boesch, F.T., Wang, J.F.: Reliable circulant networks with minimum transmission delay. IEEE Trans. Circuits Syst. 32, 1286\u20131291 (1985)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"38_CR5","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Graduate Texts in Mathematics, vol. 244. Springer, London (2008)"},{"key":"38_CR6","volume-title":"On Self-Dual Quantum Codes, Graphs and Boolean Functions","author":"LE Danielsen","year":"2005","unstructured":"Danielsen, L.E.: On Self-Dual Quantum Codes, Graphs and Boolean Functions. University of Bergen, Norway (2005)"},{"issue":"4","key":"38_CR7","doi-asserted-by":"publisher","first-page":"329","DOI":"10.3934\/amc.2009.3.329","volume":"3","author":"LE Danielsen","year":"2009","unstructured":"Danielsen, L.E.: Graph-based classification of self-dual additive codes over finite field. Adv. Math. Commun. 3(4), 329\u2013348 (2009)","journal-title":"Adv. Math. Commun."},{"issue":"8","key":"38_CR8","doi-asserted-by":"publisher","first-page":"5500","DOI":"10.1109\/TIT.2012.2196255","volume":"58","author":"LE Danielsen","year":"2012","unstructured":"Danielsen, L.E.: On the classification of Hermitian self-dual additive codes over GF(9). IEEE Trans. Inform. Theory 58(8), 5500\u20135511 (2012)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"38_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10623-010-9469-6","volume":"59","author":"LE Danielsen","year":"2011","unstructured":"Danielsen, L.E., Parker, M.G.: Directed graph representation of half-rate additive codes over GF(4). Des. Codes Cryptogr. 59, 119\u2013130 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"1351","DOI":"10.1016\/j.jcta.2005.12.004","volume":"113","author":"LE Danielsen","year":"2006","unstructured":"Danielsen, L.E., Parker, M.G.: On the classification of all self-dual additive codes over $$GF(4)$$ G F ( 4 ) of length up to $$12$$ 12 . J. Combin. Theory Series 113, 1351\u20131367 (2006)","journal-title":"J. Combin. Theory Series"},{"key":"38_CR11","volume-title":"The Geometry of Additive Quantum Codes, Preface","author":"DG Glynn","year":"2006","unstructured":"Glynn, D.G., Gulliver, T.A., Marks, J.G., Gupta, M.K.: The Geometry of Additive Quantum Codes, Preface. Springer, Berlin (2006)"},{"key":"38_CR12","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes. http:\/\/www.codetables.de . Accessed 31 October 2013"},{"key":"38_CR13","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.disc.2003.10.027","volume":"283","author":"TA Gulliver","year":"2004","unstructured":"Gulliver, T.A., \u00d6sterg\u00e5rd, P.R.J.: Binary optimal linear rate $$1\/2$$ 1 \/ 2 codesraphs. Discrete Math. 283, 255\u2013261 (2004)","journal-title":"Discrete Math."},{"key":"38_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10623-010-9444-2","volume":"61","author":"S Han","year":"2011","unstructured":"Han, S., Lee, H., Lee, Y.: Binary formally self-dual odd codes. Des. Codes Cryptogr. 61, 141\u2013150 (2011)","journal-title":"Des. Codes Cryptogr."},{"key":"38_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of Error-Correcting Codes","author":"WC Huffman","year":"2003","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University, Cambridge (2003)"},{"issue":"1\u20133","key":"38_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0012-365X(01)00374-0","volume":"254","author":"B Mans","year":"2002","unstructured":"Mans, B., Pappalardi, F., Shparlinski, I.: On the spectral Adam property for circulant graphs. Discrete Math. 254(1\u20133), 309\u2013329 (2002)","journal-title":"Discrete Math."},{"issue":"1","key":"38_CR17","doi-asserted-by":"publisher","first-page":"1250002","DOI":"10.1142\/S1793830912500024","volume":"4","author":"EA Monakhova","year":"2012","unstructured":"Monakhova, E.A.: A survey on undirected circulant graphs. Discrete Math. Algor. Appl. 4(1), 1250002 (2012)","journal-title":"Discrete Math. Algor. Appl."},{"issue":"1","key":"38_CR18","doi-asserted-by":"crossref","first-page":"501","DOI":"10.37236\/1363","volume":"5","author":"ME Muzychuk","year":"1998","unstructured":"Muzychuk, M.E., Tinhofer, G.: Recognizing circulant graphs of prime order in polynomial time. Electron. J. Combin. 5(1), 501\u2013528 (1998)","journal-title":"Electron. J. Combin."},{"key":"38_CR19","unstructured":"Stein, W.A., et al.: Sage Mathematics Software (Version 6.1.1), The Sage Development Team (2014). http:\/\/www.sagemath.org"},{"key":"38_CR20","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/S0012-365X(02)00513-7","volume":"257","author":"V Tonchev","year":"2002","unstructured":"Tonchev, V.: Error-correcting codes from graphs. Discrete Math. 257, 549\u2013557 (2002)","journal-title":"Discrete Math."},{"key":"38_CR21","first-page":"73","volume":"6","author":"Z Varbanov","year":"2008","unstructured":"Varbanov, Z.: Additive circulant graph codes over GF(4). Math. Maced. 6, 73\u201379 (2008)","journal-title":"Math. Maced."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26626-8_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,12]],"date-time":"2020-09-12T10:41:03Z","timestamp":1599907263000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26626-8_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319266251","9783319266268"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26626-8_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}