{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T04:21:43Z","timestamp":1777436503916,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1007\/bf00124893","type":"journal-article","created":{"date-parts":[[2004,10,31]],"date-time":"2004-10-31T15:50:19Z","timestamp":1099237819000},"page":"137-157","source":"Crossref","is-referenced-by-count":71,"title":["Optimal ternary linear codes"],"prefix":"10.1007","volume":"2","author":[{"given":"R.","family":"Hill","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. E.","family":"Newton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"CR1","first-page":"211","volume":"10","author":"B.I. Belov","year":"1974","unstructured":"Belov, B.I., Logachev, V.N., and Sandimirov, V.P. 1974. Construction of a class of linear binary codes achieving the Varshimov-Griesmer bound. Problems of Info. transmission 10 (3):211?217.","journal-title":"Problems of Info. transmission"},{"key":"CR2","first-page":"239","volume":"20","author":"S.M. Dodunekov","year":"1984","unstructured":"Dodunekov, S.M. 1984. Minimum block length of a linear q-ary code with specified dimension and code distance. Problems of Info. Trans. 20:239?249.","journal-title":"Problems of Info. Trans."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1109\/TIT.1987.1057363","volume":"33","author":"S.M. Dodunekov","year":"1987","unstructured":"Dodunekov, S.M., Helleseth, T., Manev, N., and Ytrehus, ?. 1987. New bounds on binary linear codes of dimension eight. IEEE Trans. Info. Theory 33:917?919.","journal-title":"IEEE Trans. Info. Theory"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1049\/el:19700293","volume":"6","author":"P.G. Farrell","year":"1970","unstructured":"Farrell, P.G. 1970. Linear binary anticodes. Electronics Letters 6:419?421.","journal-title":"Electronics Letters"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0097-3165(83)90002-X","volume":"35","author":"R.A. Games","year":"1983","unstructured":"Games, R.A. 1983. The packing problem for projective geometries over GF(3) with dimension greater than 5 J. Comb. Theory, Series A, 35:126?144.","journal-title":"J. Comb. Theory, Series A"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00124211","volume":"2","author":"P.P. Greenough","year":"1992","unstructured":"Greenough, P.P., and Hill, R. 1992. Optimal ternary quasi-cyclic codes. Designs, Codes and Cryptography 2:81?91.","journal-title":"Designs, Codes and Cryptography"},{"key":"CR7","first-page":"532","volume":"4","author":"J.H. Griesmer","year":"1960","unstructured":"Griesmer, J.H. 1960. A bound for error-correcting codes. I.B.M. J. Res. Develop 4:532?542.","journal-title":"I.B.M. J. Res. Develop"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0012-365X(89)90353-1","volume":"77","author":"N. Hamada","year":"1989","unstructured":"Hamada, N., and Deza, M. 1989. A survey of recent works with respect to a characterization of an (n, k, d; q)-code meeting the Griesmer bound using a min. hyper in a finite projective geometry. Discrete Math. 77:75?87.","journal-title":"Discrete Math."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TIT.1973.1055009","volume":"19","author":"H.J. Helgert","year":"1973","unstructured":"Helgert, H.J., and Stinaff, R.D. 1973. Minimum-distance bounds for binary linear codes. IEEE Trans. Info. Theory 19:344?356.","journal-title":"IEEE Trans. Info. Theory"},{"key":"CR10","series-title":"Report on Information","volume-title":"New bounds on the minimum length of binary linear block codes of dimension 8","author":"T. Helleseth","year":"1986","unstructured":"Helleseth T., and Ytrehus, ?. 1986. New bounds on the minimum length of binary linear block codes of dimension 8. Report on Information, no. 21, Dept. of Informatics, Univ. of Bergen, Norway."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(78)90120-6","volume":"22","author":"R. Hill","year":"1978","unstructured":"Hill, R. 1978. Caps and codes. Discrete Math. 22:111?137.","journal-title":"Discrete Math."},{"key":"CR12","unstructured":"Hill, R. 1991. Optimal linear codes. In Cryptography and Coding II, edited by C. Mitchell, Oxford University Press, 75?104."},{"key":"CR13","first-page":"61","volume":"25","author":"R. Hill","year":"1988","unstructured":"Hill, R., and Newton, D.E. 1988. Some optimal ternary linear codes. Ars Combinatoria, 25A:61?72.","journal-title":"Ars Combinatoria"},{"key":"CR14","volume-title":"The theory of error-correcting codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., and Sloane, N.J. A. 1977. The theory of error-correcting codes, Amsterdam: North-Holland."},{"key":"CR15","unstructured":"Newton, D.E. 1990. Optimal ternary linear codes. Ph.D. Thesis, Department of Mathematics and Computer Science, University of Salford."},{"key":"CR16","volume-title":"Introduction to the theory of error-correcting codes","author":"V. Pless","year":"1982","unstructured":"Pless, V. 1982. Introduction to the theory of error-correcting codes, New York: Wiley."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","volume":"8","author":"G. Solomon","year":"1965","unstructured":"Solomon, G., and Stiffler, J.J. 1965. Algebraically punctured cyclic codes. Info. and Control 8:170?179.","journal-title":"Info. and Control"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0012-365X(81)90166-7","volume":"33","author":"H.C.A. Tilborg van","year":"1981","unstructured":"van Tilborg, H.C.A. 1981. The smallest length of binary 7-dimensional linear codes with prescribed minimum distance. Disc. Math. 33:197?207.","journal-title":"Disc. Math."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1109\/TIT.1987.1057356","volume":"Vol. IT-33","author":"T. Verhoeff","year":"1987","unstructured":"Verhoeff, T.. 1987. An updated table of minimum-distance bounds for binary linear codes. IEEE Trans. Info. Theory, Vol. IT-33:665?680.","journal-title":"IEEE Trans. Info. Theory"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1109\/18.54894","volume":"36","author":"?. Ytrehus","year":"1990","unstructured":"Ytrehus, ?., and Helleseth, T. 1990. There is no binary [25, 8, 10]-code. IEEE Trans. Info Theory, 36:695?696.","journal-title":"IEEE Trans. Info Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00124893.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00124893\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00124893","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T09:18:14Z","timestamp":1554283094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00124893"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["BF00124893"],"URL":"https:\/\/doi.org\/10.1007\/bf00124893","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}