{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:24:30Z","timestamp":1775053470308,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1008215724132","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"5-11","source":"Crossref","is-referenced-by-count":5,"title":["Some New Optimal Ternary Linear Codes"],"prefix":"10.1007","volume":"12","author":[{"given":"Iliya","family":"Boukliev","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"136843_CR1","unstructured":"G. Bogdanova and I. Boukliev, New linear codes of dimension 5 over GF(3), Proc. Inter. Workshop ACCT-94, Novgorod, Russia (1994) pp. 41\u201343."},{"key":"136843_CR2","unstructured":"A. E. Brouwer and M. van Eupen, The correspondence between projective codes and 2-weight codes, Designs, Codes and Cryptography (to appear)."},{"key":"136843_CR3","unstructured":"R. N. Daskalov, Bounds for binary and ternary linear codes, Ph.D. Thesis (1993)."},{"key":"136843_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1109\/18.272479","volume":"40","author":"M. van Eupen","year":"1994","unstructured":"M. van Eupen, Five new optimal ternary linear codes, IEEE Trans. Info. Theory, Vol. 40 (1994) p. 193.","journal-title":"IEEE Trans. Info. Theory"},{"key":"136843_CR5","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1109\/18.382031","volume":"41","author":"M. van Eupen","year":"1995","unstructured":"M. van Eupen, Four non-existence results for ternary linear codes, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 800\u2013805.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"136843_CR6","doi-asserted-by":"crossref","first-page":"2048","DOI":"10.1109\/18.476334","volume":"41","author":"M. van Eupen","year":"1995","unstructured":"M. van Eupen, Some new results for ternary linear codes of dimension 5 and 6, IEEE Trans. Inform. Theory, Vol. 41,No. 6 (1995) pp. 2048\u20132051.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"136843_CR7","first-page":"235","volume":"7","author":"M. van Eupen","year":"1996","unstructured":"M. van Eupen, N. Hamada and Y. Watamori, The nonexistence of ternary [50, 5, 32] codes, Designs, Codes and Cryptography, Vol. 7,No. 3 (1996) pp. 235\u2013237.","journal-title":"Designs, Codes and Cryptography"},{"issue":"3","key":"136843_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01388456","volume":"4","author":"M. van Eupen","year":"1994","unstructured":"M. van Eupen and R. Hill, An optimal termary [69, 5, 45] code and related codes, Designs, Codes and Cryptography, Vol. 4,No. 3 (1994) pp. 271\u2013282.","journal-title":"Designs, Codes and Cryptography"},{"key":"136843_CR9","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1147\/rd.45.0532","volume":"4","author":"J. H. Griesmer","year":"1960","unstructured":"J. H. Griesmer, A bound for error-correcting codes, IBM J. Res. Devel., Vol. 4 (1960) pp. 532\u2013542.","journal-title":"IBM J. Res. Devel."},{"key":"136843_CR10","doi-asserted-by":"crossref","first-page":"1182","DOI":"10.1109\/18.391267","volume":"41","author":"T. A. Gulliver","year":"1995","unstructured":"T. A. Gulliver, New optimal ternary linear codes, IEEE Trans. Inform. Theory, Vol. 41 (1995) pp. 1182\u20131185.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136843_CR11","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1109\/18.144719","volume":"38","author":"T. A. Gulliver","year":"1992","unstructured":"T. A. Gulliver and V. K. Bhargava, Some best rate 1\/p and rate (p \u2212 1)\/p systematic quasi-cyclic codes over GF(3) and GF(4), IEEE Trans. Inform. Theory, Vol. 38 (1992) pp. 1369\u20131375.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136843_CR12","unstructured":"T. A. Gulliver and V. K. Bhargava, New good rate (m \u2212 1)\/pm ternary and quaternary quasi-cyclic codes, Designs, Codes and Cryptography (to appear)."},{"key":"136843_CR13","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1109\/18.119683","volume":"38","author":"F. R. Kschischang","year":"1992","unstructured":"F. R. Kschischang and S. Pasupathy, Some ternary and quaternary codes and associated sphere packings, IEEE Trans. Inform. Theory, Vol. 38 (1992) pp. 227\u2013246.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"136843_CR14","unstructured":"I. Landgev, Nonexistence of [143, 5, 94]3 Codes, Proc. Inter. Workshop OCRT'95, Sozopol, Bulgaria (1995) pp. 108\u2013116."},{"key":"136843_CR15","first-page":"161","volume":"18","author":"N. Hamada","year":"1993","unstructured":"N. Hamada, A survey of recent work on characterization of minihypers in P G(t, q) and nonbinary linear codes meeting the Griesmer bound, J. Combin. Inform. Syst. Sci., Vol. 18 (1993) pp. 161\u2013191.","journal-title":"J. Combin. Inform. Syst. Sci."},{"key":"136843_CR16","series-title":"Technical Report","volume-title":"The nonexistence of [303, 6, 201; 3]-codes meeting the Griesmer bound","author":"N. Hamada","year":"1995","unstructured":"N. Hamada, The nonexistence of [303, 6, 201; 3]-codes meeting the Griesmer bound, Technical Report OWUAM-009, Osaka Women's Univ., Sakai, Osaka 590, Japan (1995)."},{"key":"136843_CR17","unstructured":"N. Hamada and T. Helleseth, The uniqueness of [87, 5, 57; 33]-codes and the nonexistence of [258, 6, 171; 3]-codes, J. Statist. Plann. Inference (to appear)."},{"key":"136843_CR18","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1006\/ffta.1995.1036","volume":"1","author":"N. Hamada","year":"1995","unstructured":"N. Hamada and T. Helleseth, Construction of some optimal ternary codes and the uniqueness of [294, 6, 195; 3]-codes meeting the Griesmer bound, Finite Field and Their Application, Vol. 1 (1995) pp. 458\u2013468.","journal-title":"Finite Field and Their Application"},{"key":"136843_CR19","unstructured":"N. Hamada and T. Helleseth, The nonexistence of ternary [270, 6, 179] codes and [309, 6, 205] codes, Proc. Inter. Workshop OCRT'95, Sozopol, Bulgaria (1995) pp. 65\u201368."},{"key":"136843_CR20","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF00141966","volume":"2","author":"N. Hamada","year":"1992","unstructured":"N. Hamada, T. Helleseth and \u00d8. Ytrehus, On the construction of a [q\n4 + q\n2 \u2212 q, 5, q\n4 \u2212 q\n3 + q\n2 \u2212 2q; q]-code meeting the Griesmer bound, Designs, Codes and Cryptography, Vol. 2 (1992) pp. 225\u2013229.","journal-title":"Designs, Codes and Cryptography"},{"key":"136843_CR21","unstructured":"N. Hamada and Y. Watamori, The nonexistence of [71, 5, 46; 3]-codes, J. Statist. Plann. Inference (to appear)."},{"key":"136843_CR22","first-page":"577","volume":"43","author":"N. Hamada","year":"1996","unstructured":"N. Hamada and Y. Watamori, The nonexistence of some ternary linear codes of dimension 6 and the bounds for n\n3(6, d), 1 \u2264 d \u2264 243, Math. Japonica, Vol. 43 (1996) pp. 577\u2013593.","journal-title":"Math. Japonica"},{"key":"136843_CR23","unstructured":"R. Hill, Optimal Linear Codes: Cryptography and Coding II (C. Mitchell, ed.), Oxford University Press (1992) pp. 75\u2013104."},{"key":"136843_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(78)90120-6","volume":"22","author":"R. Hill","year":"1978","unstructured":"R. Hill, Caps and codes, Discrete Math., Vol. 22 (1978) pp. 111\u2013137.","journal-title":"Discrete Math."},{"key":"136843_CR25","unstructured":"R. Hill and P.P. Greenough, Optimal quasi-twisted codes, Proc. Inter. Workshop ACCT-92, Voneshta voda, Bulgaria (1992) pp. 92\u201397."},{"issue":"2","key":"136843_CR26","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00124893","volume":"2","author":"R. Hill","year":"1992","unstructured":"R. Hill and D. E. Newton, Optimal ternary linear codes, Designs, Codes and Cryptography, Vol. 2,No. 2 (1992) pp. 137\u2013157.","journal-title":"Designs, Codes and Cryptography"},{"key":"136843_CR27","unstructured":"A. Said and R. Palazzo, Heuristic search: A new method to design good unit memory convolutional codes, Proc. Fourth Swedish-Soviet Inter. Workshop on Inf. Theory, Gotland, Sweden (1989) pp. 325\u2013331."},{"key":"136843_CR28","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/S0019-9958(65)90080-X","volume":"8","author":"G. Solomon","year":"1965","unstructured":"G. Solomon and J. J. Stiffler, Algebraically punctured cyclic codes, Inform. and Control., Vol. 8 (1965) pp. 170\u2013179.","journal-title":"Inform. and Control."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008215724132.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008215724132\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008215724132.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:04:05Z","timestamp":1753758245000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008215724132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["136843"],"URL":"https:\/\/doi.org\/10.1023\/a:1008215724132","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}