{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:34:16Z","timestamp":1755794056152,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319662770"},{"type":"electronic","value":"9783319662787"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66278-7_19","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T09:34:12Z","timestamp":1503394452000},"page":"228-237","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["New Lower Bounds on Error-Correcting Ternary, Quaternary and Quinary Codes"],"prefix":"10.1007","author":[{"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":[[2017,8,23]]},"reference":[{"key":"19_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":"19_CR2","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S0021-9800(69)80115-8","volume":"6","author":"EF Assmus","year":"1969","unstructured":"Assmus, E.F., Mattson, H.F.: New 5-designs. J. Combin. Theory 6, 122\u2013151 (1969)","journal-title":"J. Combin. Theory"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(72)90021-0","volume":"3","author":"EF Assmus","year":"1972","unstructured":"Assmus, E.F., Mattson, H.F.: On weights in quadratic-residue codes. Discrete Math. 3, 1\u201320 (1972)","journal-title":"Discrete Math."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TIT.1978.1055827","volume":"24","author":"M Best","year":"1978","unstructured":"Best, M., Brouwer, A.E., MacWilliams, F.J., Odlyzko, A.M., Sloane, N.J.A.: Bounds for binary codes of length less than 25. IEEE Trans. Inform. Theory 24, 81\u201393 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"19_CR5","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":"19_CR6","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1109\/18.567723","volume":"43","author":"I Boukliev","year":"1997","unstructured":"Boukliev, I., Kapralov, S., Maruta, T., Fukui, M.: Optimal linear codes of dimension 4 over $$F_5$$. IEEE Trans. Inform. Theory 43, 308\u2013313 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"19_CR7","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. Discrete Math. 240, 13\u201319 (2001)","journal-title":"Discrete Math."},{"key":"19_CR8","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":"19_CR9","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":"19_CR10","unstructured":"C\u00f3digo [pseud.], A discussion on Foros de Free1X2.com, cited by Andries Brouwer at https:\/\/www.win.tue.nl\/~aeb\/codes\/ternary-1.html"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1109\/TIT.1979.1056047","volume":"25","author":"JH Conway","year":"1979","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. Inform. Theory 25, 312\u2013322 (1979)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"19_CR12","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":"19_CR13","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":"19_CR14","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":"19_CR15","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1109\/18.119683","volume":"38","author":"FR Kschischang","year":"1992","unstructured":"Kschischang, F.R., Subbarayan, P.: Some ternary and quaternary codes and associated sphere packings. IEEE Trans. Inform. Theory 38, 227\u2013246 (1992)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"19_CR16","unstructured":"Laaksonen, A., \u00d6sterg\u00e5rd, P.R.J.: Constructing error-correcting binary codes using transitive permutation groups (submitted). Preprint at. arXiv:1604.06022"},{"key":"19_CR17","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes, North-Holland, Amsterdam (1977)"},{"key":"19_CR18","unstructured":"Niskanen, S., \u00d6sterg\u00e5rd, P.R.J.: Cliquer User\u2019s Guide, Version 1.0, Communications Laboratory, Helsinki University of Technology, Espoo, Finland, Technical report T48 (2003)"},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10623-004-1723-3","volume":"36","author":"PRJ \u00d6sterg\u00e5rd","year":"2005","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: Two new four-error-correcting binary codes. Des. Codes Cryptogr. 36, 327\u2013329 (2005)","journal-title":"Des. Codes Cryptogr."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1109\/TIT.1960.1057584","volume":"6","author":"M Plotkin","year":"1960","unstructured":"Plotkin, M.: Binary codes with specified minimum distance. IRE Trans. Inform. Theory 6, 445\u2013450 (1960)","journal-title":"IRE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66278-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:05:36Z","timestamp":1710345936000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66278-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319662770","9783319662787"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66278-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMCTA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Castle Meeting on Coding Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vihula","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Estonia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmcta2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.castle-meeting-2017.ut.ee\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}