{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T15:31:31Z","timestamp":1769268691506,"version":"3.49.0"},"reference-count":31,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3521,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[2004,1]]},"DOI":"10.1016\/s0012-365x(03)00126-2","type":"journal-article","created":{"date-parts":[[2003,6,20]],"date-time":"2003-06-20T22:47:46Z","timestamp":1056149266000},"page":"97-110","source":"Crossref","is-referenced-by-count":17,"title":["New minimum distance bounds for linear codes over GF(5)"],"prefix":"10.1016","volume":"275","author":[{"given":"Rumen","family":"Daskalov","sequence":"first","affiliation":[]},{"given":"Plamen","family":"Hristov","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Metodieva","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00126-2_BIB1","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/A:1011283523000","article-title":"The structure of 1-generator quasi-twisted codes and new linear codes","volume":"24","author":"Aydin","year":"2001","journal-title":"Designs Codes Cryptogr."},{"key":"10.1016\/S0012-365X(03)00126-2_BIB2","series-title":"Algebraic Coding Theory","author":"Berlekamp","year":"1968"},{"issue":"1","key":"10.1016\/S0012-365X(03)00126-2_BIB3","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/18.567723","article-title":"Optimal linear codes of dimension 4 over GF(5)","volume":"43","author":"Boukliev","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB4","unstructured":"A.E. Brouwer, Linear code bound [electronic table; online], http:\/\/www.win.tue.nl\/~aeb\/voorlincod.html."},{"key":"10.1016\/S0012-365X(03)00126-2_BIB5","unstructured":"V. Chepyzhov, A Gilbert\u2013Varshamov bound for quas-twisted codes of rate 1\/n, Proceedings of the Joint Swedish-Russian International Workshop on Information Theory, M\u00f6lle, Sweden, 1993, pp. 214\u2013218."},{"key":"10.1016\/S0012-365X(03)00126-2_BIB6","unstructured":"R.N. Daskalov, New bounds on minimum distance for 9-dimensional linear codes over GF(5), in: Proceedings of Seventh International Workshop on Algebraic and Combinatorial Coding Theory, Bansko, Bulgaria, June 18\u201324, 2000, pp. 112\u2013116."},{"issue":"6","key":"10.1016\/S0012-365X(03)00126-2_BIB7","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s002000050117","article-title":"Bounds on minimum distance for linear codes over GF(5)","volume":"9","author":"Daskalov","year":"1999","journal-title":"Appl. Algebra Eng. Comm. Comput."},{"issue":"1","key":"10.1016\/S0012-365X(03)00126-2_BIB8","first-page":"59","article-title":"New one-generator quasi-cyclic codes over GF(7)","volume":"38","author":"Daskalov","year":"2002","journal-title":"Problemi Peredachi Inform."},{"key":"10.1016\/S0012-365X(03)00126-2_BIB9","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1109\/18.651076","article-title":"A link between quasi-cyclic codes and convolutional codes","volume":"44","author":"Esmaeili","year":"1998","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB10","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00124211","article-title":"Optimal ternary quasi-cyclic codes","volume":"2","author":"Greenough","year":"1992","journal-title":"Designs Codes Cryptogr."},{"key":"10.1016\/S0012-365X(03)00126-2_BIB11","series-title":"Cryptography and Coding II","first-page":"75","article-title":"Optimal linear codes","author":"Hill","year":"1992"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB12","unstructured":"R. Hill, P.P. Greenough, Optimal quasi-twisted codes, Proceedings of the International Workshop on Algebraic and Combinatorial Coding Theory, Voneshta Voda, Bulgaria, 1992, pp. 92\u201397."},{"key":"10.1016\/S0012-365X(03)00126-2_BIB13","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/BF00124893","article-title":"Optimal ternary linear codes","volume":"2","author":"Hill","year":"1992","journal-title":"Designs Codes Cryptogr."},{"issue":"3","key":"10.1016\/S0012-365X(03)00126-2_BIB14","doi-asserted-by":"crossref","first-page":"950","DOI":"10.1109\/18.135637","article-title":"Cyclic concatenated codes with constacyclic outer codes","volume":"38","author":"Jensen","year":"1992","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/S0012-365X(03)00126-2_BIB15","doi-asserted-by":"crossref","first-page":"951","DOI":"10.1109\/18.335910","article-title":"A class of constacyclic codes","volume":"40","author":"Jensen","year":"1994","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"4","key":"10.1016\/S0012-365X(03)00126-2_BIB16","doi-asserted-by":"crossref","first-page":"880","DOI":"10.1109\/18.53751","article-title":"Pseudocyclic maximum-distance-separable codes","volume":"36","author":"Krishna","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB17","doi-asserted-by":"crossref","unstructured":"I.N. Landjev, Optimal Linear Codes of Dimension 4 Over F5, Lecture Notes in Computer Science, 1255, Springer, Berlin, 1997, pp. 212\u2013220.","DOI":"10.1007\/3-540-63163-1_17"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB18","unstructured":"I. Landjev, A. Rousseva, Optimal linear codes over F5, in: Proceedings of the 7th International Workshop on ACCT, 18\u201324 June, Bansko, Bulgaria, 2000, pp. 207\u2013212."},{"key":"10.1016\/S0012-365X(03)00126-2_BIB19","unstructured":"I. Landjev, A. Rousseva, T. Maruta, R. Hill, On optimal codes over the field with five elements, manuscript."},{"key":"10.1016\/S0012-365X(03)00126-2_BIB20","series-title":"The Theory of Error-Correcting Codes","author":"MacWilliams","year":"1977"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB21","series-title":"Advances in Finite Geometries and Designs","first-page":"311","article-title":"A geometric approach to semi-cyclic codes","author":"Maruta","year":"1991"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB22","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0012-365X(99)00088-6","article-title":"On the minimum length of q-ary linear codes of dimension four","volume":"208\/209","author":"Maruta","year":"1999","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00126-2_BIB23","unstructured":"T. Maruta, I. Landjev, A. Rousseva, On the minimum size of some minihypers and related linear codes, manuscript."},{"issue":"3","key":"10.1016\/S0012-365X(03)00126-2_BIB24","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TIT.1984.1056909","article-title":"Maximum distance separable multi-level codes","volume":"30","author":"da Rocha","year":"1984","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB25","unstructured":"G.E. S\u00e9guin, G. Drolet, The theory of 1-generator quasi-cyclic codes, Technical Report, Royal Military College of Canada, Kingston, ON, 1991."},{"issue":"4","key":"10.1016\/S0012-365X(03)00126-2_BIB26","doi-asserted-by":"crossref","first-page":"1554","DOI":"10.1109\/18.850694","article-title":"New ternary quasi-cyclic codes with better minimum distances","volume":"46","author":"Siap","year":"2000","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB27","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1023\/A:1008356131869","article-title":"New codes over F3 and F5 and improvements on bounds","volume":"21","author":"Siap","year":"2000","journal-title":"Designs Codes Cryptogr."},{"issue":"10","key":"10.1016\/S0012-365X(03)00126-2_BIB28","doi-asserted-by":"crossref","first-page":"2764","DOI":"10.1109\/TIT.2002.802639","article-title":"New codes over F5 obtained by tripling method and improvements on their bounds","volume":"48","author":"Siap","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/S0012-365X(03)00126-2_BIB29","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1137\/0137027","article-title":"A connection between block and convolutional codes","volume":"37","author":"Solomon","year":"1979","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"10.1016\/S0012-365X(03)00126-2_BIB30","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/jcta.1997.2864","article-title":"Divisibility of codes meeting the Griesmer bound","volume":"83","author":"Ward","year":"1998","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0012-365X(03)00126-2_BIB31","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1008356719912","article-title":"The nonexistence of a [207,4,165] code over GF(5)","volume":"22","author":"Ward","year":"2001","journal-title":"Designs Codes Cryptogr."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001262?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03001262?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,22]],"date-time":"2020-03-22T07:38:03Z","timestamp":1584862683000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03001262"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,1]]},"references-count":31,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,1]]}},"alternative-id":["S0012365X03001262"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00126-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,1]]}}}