{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T03:06:41Z","timestamp":1775012801259,"version":"3.50.1"},"reference-count":18,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T00:00:00Z","timestamp":1180656000000},"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":["Probl Inf Transm"],"published-print":{"date-parts":[[2007,6]]},"DOI":"10.1134\/s0032946007020056","type":"journal-article","created":{"date-parts":[[2007,7,24]],"date-time":"2007-07-24T15:00:40Z","timestamp":1185289240000},"page":"124-131","source":"Crossref","is-referenced-by-count":1,"title":["Some high-rate linear codes over GF(5) and GF(7)"],"prefix":"10.1134","volume":"43","author":[{"given":"R.","family":"Daskalov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","reference":[{"key":"2005_CR1","volume-title":"The Theory of Error-Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz\u2019, 1979."},{"issue":"6","key":"2005_CR2","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s002000050117","volume":"9","author":"R.N. Daskalov","year":"1999","unstructured":"Daskalov, R.N. and Gulliver, T.A., Bounds on Minimum Distance for Linear Codes over G F(5), Appl. Algebra Engrg. Comm. Comput., 1999, vol. 9, no. 6, pp. 547\u2013558.","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"issue":"1\u20133","key":"2005_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0012-365X(03)00126-2","volume":"275","author":"R. Daskalov","year":"2004","unstructured":"Daskalov, R., Hristov, P., and Metodieva, E., New Minimum Distance Bounds for Linear Codes over GF(5), Discrete Math., 2004, vol. 275, no. 1\u20133, pp. 97\u2013110.","journal-title":"Discrete Math."},{"key":"2005_CR4","doi-asserted-by":"crossref","unstructured":"Grassl, M. and White, G., New Good Linear Codes by Special Puncturings, in Proc. 2004 IEEE Int. Sympos. on Information Theory, Chicago, USA, 2004, p. 454.","DOI":"10.1109\/ISIT.2004.1365491"},{"key":"2005_CR5","doi-asserted-by":"crossref","unstructured":"Grassl, M. and White, G., New Codes from Chains of Quasi-cyclic Codes, in Proc. 2005 IEEE Int. Sympos. on Information Theory, Adelaide, Australia, 2005, pp. 2095\u20132099.","DOI":"10.1109\/ISIT.2005.1523715"},{"key":"2005_CR6","unstructured":"Maruta, T., Takenaka, M., Shinohara, M., and Shobara, Y., Constructing New Linear Codes from Pseudo-cyclic Codes, in Proc. 9th Int. Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgaria, 2004, pp. 292\u2013298."},{"key":"2005_CR7","unstructured":"Maruta, T., Shinohara, M., Yamane, F., Tsuji, K., Takanaka, E., Miki, H., and Fujiwara, R., New Linear Codes from Cyclic and Generalized Cyclic Codes by Puncturing, in Proc. 10th Int. Workshop on Algebraic and Combinatorial Coding Theory, Zvenigorod, Russia, 2006, pp. 194\u2013197."},{"key":"2005_CR8","unstructured":"Maruta, T., Shinohara, M., and Takenaka, M., Constructing Linear Codes from Some Orbits of Projectivities, to appear in Discrete Math."},{"issue":"12","key":"2005_CR9","doi-asserted-by":"publisher","first-page":"4247","DOI":"10.1109\/TIT.2005.859291","volume":"51","author":"M. Braun","year":"2005","unstructured":"Braun, M., Kohnert, A., and Wassermann, A., Optimal Linear Codes from Matrix Groups, IEEE Trans. Inform. Theory, 2005, vol. 51, no. 12, pp. 4247\u20134251.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"2005_CR10","first-page":"175","volume":"36","author":"R.N. Daskalov","year":"2001","unstructured":"Daskalov, R.N. and Gulliver, T.A., Minimum Distance Bounds for Linear Codes over GF(7), J. Combin. Math. Combin. Comput., 2001, vol. 36, pp. 175\u2013191.","journal-title":"J. Combin. Math. Combin. Comput."},{"issue":"3","key":"2005_CR11","first-page":"24","volume":"37","author":"R.N. Daskalov","year":"2001","unstructured":"Daskalov, R.N. and Gulliver, T.A., New Minimum Distance Bounds for Linear Codes over Small Fields, Probl. Peredachi Inf., 2001, vol. 37, no. 3, pp. 24\u201333 [Probl. Inf. Trans. (Engl. Transl.), 2001, vol. 37, no. 3, pp. 206\u2013215].","journal-title":"Probl. Peredachi Inf."},{"issue":"1","key":"2005_CR12","first-page":"59","volume":"38","author":"R. Daskalov","year":"2002","unstructured":"Daskalov, R. and Hristov, P., New One-Generator Quasi-cyclic Codes over GF(7), Probl. Peredachi Inf., 2002, vol. 38, no. 1, pp. 59\u201363 [Probl. Inf. Trans. (Engl. Transl.), 2002, vol. 38, no. 1, pp. 50\u201354].","journal-title":"Probl. Peredachi Inf."},{"key":"2005_CR13","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1007\/978-3-642-59448-9_19","volume-title":"Algebraic Combinatorics and Applications","author":"T. Rehfinger","year":"2001","unstructured":"Rehfinger, T., Babu, N.S., and Zimmermann, K.-H., New Good Codes via CQuest\u2014A System for the Silicon Search of Linear Codes, Algebraic Combinatorics and Applications, Betten, A., Kohnert, A., Laue, R., and Wassermann, A., Eds., Berlin: Springer, 2001, pp. 294\u2013306."},{"key":"2005_CR14","first-page":"158","volume-title":"Mathematics and Education in Mathematics","author":"E. Metodieva","year":"2004","unstructured":"Metodieva, E., Six New Linear Codes over GF(7), in Mathematics and Education in Mathematics, Sofia: BAN, 2004, pp. 158\u2013161."},{"key":"2005_CR15","unstructured":"Brouwer, A.E., Linear Code Bounds [electronic table]. Available online at http:\/\/www.win.tue.nl\/:_aeb\/voorlincod.html."},{"issue":"1","key":"2005_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF00124211","volume":"2","author":"P.P. Greenough","year":"1992","unstructured":"Greenough, P.P. and Hill, R., Optimal Ternary Quasi-cyclic Codes, Des. Codes Cryptogr., 1992, vol. 2, no. 1, pp. 81\u201391.","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"2005_CR17","first-page":"51","volume":"69","author":"T. Koshy","year":"1977","unstructured":"Koshy, T., Polynomial Approach to Quasi-cyclic Codes, Bull. Calcutta Math. Soc., 1977, vol. 69, no. 2, pp. 51\u201359.","journal-title":"Bull. Calcutta Math. Soc."},{"key":"2005_CR18","unstructured":"S\u00e9guin, G.E. and Drolet, G., The Theory of 1-Generator Quasi-cyclic Codes, Tech. Report of Royal Military College of Canada, Kingston, 1991."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946007020056.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946007020056","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946007020056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946007020056.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:03:17Z","timestamp":1775008997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946007020056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2007,6]]}},"alternative-id":["2005"],"URL":"https:\/\/doi.org\/10.1134\/s0032946007020056","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6]]}}}