{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:11:19Z","timestamp":1754485879023,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,5,12]],"date-time":"2018-05-12T00:00:00Z","timestamp":1526083200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["#289002"],"award-info":[{"award-number":["#289002"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s12095-018-0302-9","type":"journal-article","created":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T21:37:20Z","timestamp":1526074640000},"page":"881-889","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New lower bounds on q-ary error-correcting codes"],"prefix":"10.1007","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5369-5518","authenticated-orcid":false,"given":"Antti","family":"Laaksonen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patric R. J.","family":"\u00d6sterg\u00e5rd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,12]]},"reference":[{"key":"302_CR1","doi-asserted-by":"publisher","first-page":"3004","DOI":"10.1109\/18.959279","volume":"47","author":"E Agrell","year":"2001","unstructured":"Agrell, E., Vardy, A., Zeger, K.: A table of upper bounds for binary codes. IEEE Trans. Inform. Theory 47, 3004\u20133006 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"302_CR2","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/TIT.2014.2298234","volume":"60","author":"E Bellini","year":"2014","unstructured":"Bellini, E., Guerrini, E., Sala, M.: Some bounds on the size of codes. IEEE Trans. Inform. Theory 60, 1475\u20131480 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"302_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0195-6698(03)00096-9","volume":"25","author":"A Blokhuis","year":"2004","unstructured":"Blokhuis, A., Brouwer, A.E.: Small additive quaternary codes. Eur. J. Combin. 25, 161\u2013167 (2004)","journal-title":"Eur. J. Combin."},{"key":"302_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1023\/A:1011275112159","volume":"23","author":"GT Bogdanova","year":"2001","unstructured":"Bogdanova, G.T., Brouwer, A.E., Kapralov, S.N., \u00d6sterg\u00e5rd, P.R.J.: Error-correcting codes over an alphabet of four elements. Des. Codes Cryptogr. 23, 333\u2013342 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"302_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/S0012-365X(00)00383-6","volume":"240","author":"GT Bogdanova","year":"2001","unstructured":"Bogdanova, G.T., \u00d6sterg\u00e5rd, P.R.J.: Bounds on codes over an alphabet of five elements. Discret. Math. 240, 13\u201319 (2001)","journal-title":"Discret. Math."},{"key":"302_CR6","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1109\/18.651001","volume":"44","author":"AE Brouwer","year":"1998","unstructured":"Brouwer, A.E., H\u00e4m\u00e4l\u00e4inen, H.O., \u00d6sterg\u00e5rd, P.R.J., Sloane, N.J.A.: Bounds on mixed binary\/ternary codes. IEEE Trans. Inform. Theory 44, 140\u2013161 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"302_CR7","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1080\/10586458.2008.10129046","volume":"17","author":"JJ Cannon","year":"2008","unstructured":"Cannon, J.J., Holt, D.F.: The transitive permutation groups of degree 32. Exp. Math. 17, 307\u2013314 (2008)","journal-title":"Exp. Math."},{"key":"302_CR8","unstructured":"Discussions on Foros de Free1X2.com, cited by Andries Brouwer at \n                    https:\/\/www.win.tue.nl\/aeb\/codes\/ternary-1.html"},{"key":"302_CR9","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.1109\/TIT.2004.842767","volume":"51","author":"K Elssel","year":"2005","unstructured":"Elssel, K., Zimmermann, K.-H.: Two new nonlinear binary codes. IEEE Trans. Inform. Theory 51, 1189\u20131190 (2005)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"302_CR10","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.jcta.2006.03.010","volume":"113","author":"D Gijswijt","year":"2006","unstructured":"Gijswijt, D., Schrijver, A., Tanaka, H.: New upper bounds for nonbinary codes based on the Terwilliger algebra and semidefinite programming. J. Combin. Theory Ser. A 113, 1719\u20131731 (2006)","journal-title":"J. Combin. Theory Ser. A"},{"key":"302_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jsc.2004.08.002","volume":"39","author":"A Hulpke","year":"2005","unstructured":"Hulpke, A.: Constructing transitive permutation groups. J. Symbolic Comput. 39, 1\u201330 (2005)","journal-title":"J. Symbolic Comput."},{"key":"302_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1008315701179","volume":"15","author":"MK Kaikkonen","year":"1998","unstructured":"Kaikkonen, M.K.: Codes from affine permutation groups. Des. Codes Cryptogr. 15, 183\u2013186 (1998)","journal-title":"Des. Codes Cryptogr."},{"key":"302_CR13","unstructured":"Kapralov, K.S.: The nonexistence of ternary (10,15,7) codes. In: Proceedings of the 7th International Workshop on Algebraic and Combinatorial Coding Theory, (ACCT\u20192000), Bansko, pp. 189\u2013192 (2000)"},{"key":"302_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1002\/jcd.1009","volume":"9","author":"P Kaski","year":"2001","unstructured":"Kaski, P., \u00d6stergrd, P.R.J.: There exists no (15,5,4) RBIBD. J. Combin. Des. 9, 227\u2013232 (2001)","journal-title":"J. Combin. Des."},{"key":"302_CR15","volume-title":"Classification Algorithms for Codes and Designs","author":"P Kaski","year":"2006","unstructured":"Kaski, P., \u00d6stergrd, P.R.J.: Classification Algorithms for Codes and Designs. Springer, Berlin (2006)"},{"key":"302_CR16","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.dam.2017.08.022","volume":"233","author":"A Laaksonen","year":"2017","unstructured":"Laaksonen, A., \u00d6stergrd, P.R.J.: Constructing error-correcting binary codes using transitive permutation groups. Discret. Appl. Math. 233, 65\u201370 (2017)","journal-title":"Discret. Appl. Math."},{"key":"302_CR17","doi-asserted-by":"crossref","unstructured":"Laaksonen, A., \u00d6stergrd, P.R.J., Ytrehus, \u00d8.: New lower bounds on error-correcting ternary, quaternary and quinary codes. In: Barbero, \u00c1., Skachek, V. (eds.) Coding Theory and Applications, LNCS 10495, pp 228\u2013237. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-66278-7_19"},{"key":"302_CR18","first-page":"97","volume":"188","author":"W Lang","year":"2007","unstructured":"Lang, W., Quistorff, J., Schneider, E.: New results on integer programming for codes. Congr. Numer. 188, 97\u2013107 (2007)","journal-title":"Congr. Numer."},{"key":"302_CR19","first-page":"159","volume":"51","author":"MJ Letourneau","year":"2004","unstructured":"Letourneau, M.J., Houghten, S.K.: Optimal ternary (11,7) and (14,10) error-correcting codes. J. Combin. Math. Combin. Comput. 51, 159\u2013164 (2004)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"302_CR20","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10623-016-0216-5","volume":"84","author":"B Litjens","year":"2016","unstructured":"Litjens, B., Polak, S., Schrijver, A.: Semidefinite bounds for nonbinary codes based on quadruples. Des. Codes Cryptogr. 84, 87\u2013100 (2016)","journal-title":"Des. Codes Cryptogr."},{"key":"302_CR21","first-page":"37","volume":"26B","author":"C Mackenzie","year":"1988","unstructured":"Mackenzie, C., Seberry, J.: Maximal q-ary codes and Plotkin\u2019s bound. Ars Combin. 26B, 37\u201350 (1988)","journal-title":"Ars Combin."},{"key":"302_CR22","unstructured":"Niskanen, S., \u00d6stergrd, P.R.J.: Cliquer User\u2019s Guide, Version 1.0, Communications Laboratory, Helsinki University of Technology, Espoo, Finland, Technical Report T48 (2003)"},{"key":"302_CR23","doi-asserted-by":"crossref","unstructured":"\u00d6stergrd, P.R.J.: On binary\/ternary error-correcting codes with minimum distance 4. In: Fossorier, M., Imai, H., Lin, S., Poli, A. (eds.) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, LNCS 1719, pp 472\u2013481. Springer, Berlin (1999)","DOI":"10.1007\/3-540-46796-3_45"},{"key":"302_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/S0012-365X(00)00017-0","volume":"223","author":"PRJ \u00d6stergrd","year":"2000","unstructured":"\u00d6stergrd, P.R.J.: Classification of binary\/ternary one-error-correcting codes. Discret. Math. 223, 253\u2013262 (2000)","journal-title":"Discret. Math."},{"key":"302_CR25","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10623-004-1723-3","volume":"36","author":"PRJ \u00d6stergrd","year":"2005","unstructured":"\u00d6stergrd, P.R.J.: Two new four-error-correcting binary codes. Des. Codes Cryptogr. 36, 327\u2013329 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"302_CR26","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1007\/s10623-017-0366-0","volume":"86","author":"SC Polak","year":"2018","unstructured":"Polak, S.C.: New nonbinary code bounds based on divisibility arguments. Des. Codes Cryptogr. 86, 861\u2013874 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"302_CR27","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0166-218X(93)90141-A","volume":"45","author":"RJM Vaessens","year":"1993","unstructured":"Vaessens, R.J.M., Aarts, E.H.L., van Lint, J.H.: Genetic algorithms in coding theory \u2013 a table for A\n                           3 (n, d). Discret. Appl. Math. 45, 71\u201387 (1993)","journal-title":"Discret. Appl. Math."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0302-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-018-0302-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-018-0302-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,21]],"date-time":"2019-09-21T18:44:58Z","timestamp":1569091498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-018-0302-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,12]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["302"],"URL":"https:\/\/doi.org\/10.1007\/s12095-018-0302-9","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2018,5,12]]},"assertion":[{"value":"1 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}