{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:58:34Z","timestamp":1775012314739,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"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":[[2004,10]]},"DOI":"10.1007\/s11122-005-0004-8","type":"journal-article","created":{"date-parts":[[2005,3,24]],"date-time":"2005-03-24T10:56:07Z","timestamp":1111661767000},"page":"356-364","source":"Crossref","is-referenced-by-count":2,"title":["On the error-detecting performance of some classes of block codes"],"prefix":"10.1007","volume":"40","author":[{"given":"R.","family":"Dodunekova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. M.","family":"Dodunekov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Nikolova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-2309-3","volume-title":"Error Detecting Codes: General Theory and Their Application in Feedback Communication Systems","author":"T. Kl\u00f8ve","year":"1995","unstructured":"Kl\u00f8ve, T. and Korzhik, V.I., Error Detecting Codes: General Theory and Their Application in Feedback Communication Systems, Boston: Kluwer, 1995."},{"issue":"1","key":"4_CR2","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1109\/TIT.1979.1055991","volume":"25","author":"S.K. Leung-Yan-Cheong","year":"1979","unstructured":"Leung-Yan-Cheong, S.K., Barnes, E.R., and Friedman, D.U., On Some Properties of the Undetected Error Probability of Linear Codes, IEEE Trans. Inf. Theory, 1979, vol. 25, no. 1, pp. 110\u2013112.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR3","unstructured":"Dodunekova, R., Dodunekov, S.M., and Nikolova, E., A Survey on Proper Codes, in Proc. Workshop on General Theory of Information Transfer and Combinatorics, Bielefeld, Germany, 2002, to appear."},{"key":"4_CR4","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":"4","key":"4_CR5","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1016\/S0019-9958(68)90874-7","volume":"13","author":"F.P. Preparata","year":"1968","unstructured":"Preparata, F.P., A Class of Optimum Nonlinear Double-Error-Correcting Codes, Inf. Control, 1968, vol. 13, no. 4, pp. 378\u2013400.","journal-title":"Inf. Control"},{"issue":"2","key":"4_CR6","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"A.M. Kerdock","year":"1972","unstructured":"Kerdock, A.M., A Class of Low-Rate Nonlinear Binary Codes, Inf. Control, 1972, vol. 20, no. 2, pp. 182\u2013187.","journal-title":"Inf. Control"},{"issue":"1","key":"4_CR7","first-page":"38","volume":"7","author":"N.V. Semakov","year":"1971","unstructured":"Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., Uniformly Packed Codes, Probl. Peredachi Inf., 1971, vol. 7, no. 1, pp. 38\u201350 [Probl. Inf. Trans. (Engl. Transl.), 1971, vol. 7, no. 1, pp. 30\u201339].","journal-title":"Probl. Peredachi Inf."},{"key":"4_CR8","unstructured":"Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., On the Duality of Preparata and Kerdock Codes, in Proc. 5th All-Union Conf. on Coding Theory, Moscow-Gorky, 1972, Part 2, pp. 55\u201358."},{"issue":"2","key":"4_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1109\/18.312154","volume":"40","author":"A.R. Hammons Jr.","year":"1994","unstructured":"Hammons, A.R., Jr., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., and Sol\u00e9, P., The \u21244-Linearity of Kerdock, Preparata, Goethals, and Related Codes, IEEE Trans. Inf. Theory, 1994, vol. 40, no. 2, pp. 301\u2013319.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"4_CR10","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1109\/TIT.1962.1057721","volume":"8","author":"L.D. Grey","year":"1962","unstructured":"Grey, L.D., Some Bounds for Error-Correcting Codes, IEEE Trans. Inf. Theory, 1962, vol. 8, no. 3, pp. 200\u2013202.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1017\/S2040618500033219","volume":"2","author":"R.A. Rankin","year":"1955","unstructured":"Rankin, R.A., The Closest Packing of Spherical Caps in n Dimensions, Proc. Glasgow Math. Assoc., 1955, vol. 2, pp. 139\u2013144.","journal-title":"Proc. Glasgow Math. Assoc."},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1112\/S0025579300000851","volume":"3","author":"R.A. Rankin","year":"1956","unstructured":"Rankin, R.A., On the Minimal Points of Positive Definite Quadratic Forms, Mathematika, 1956, vol. 3, pp. 15\u201324.","journal-title":"Mathematika"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/jcta.1997.2765","volume":"78","author":"G. McGuire","year":"1997","unstructured":"McGuire, G., Quasi-Symmetric Designs and Codes Meeting the Grey-Rankin Bound, J. Combin. Theory, Ser. A, 1997, vol. 78, pp. 280\u2013291.","journal-title":"J. Combin. Theory, Ser. A"},{"issue":"4","key":"4_CR14","first-page":"455","volume":"10","author":"A.E. Brouwer","year":"1985","unstructured":"Brouwer, A.E., Some New Two-Weight Codes and Strongly Regular Graphs, Discrete Appl. Math., 1985, vol. 10, no. 4, pp. 455\u2013461.","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"4_CR15","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF00123764","volume":"1","author":"D. Jungnickel","year":"1991","unstructured":"Jungnickel, D. and Tonchev, V.D., Exponential Number of Quasi-Symetric SDP Designs and Codes Meeting the Grey-Rankin Bound, Des. Codes Cryptogr., 1991, vol. 1, no. 3, pp. 247\u2013253.","journal-title":"Des. Codes Cryptogr."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11122-005-0004-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11122-005-0004-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11122-005-0004-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11122-005-0004-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:55:15Z","timestamp":1775008515000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11122-005-0004-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,10]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s11122-005-0004-8","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,10]]}}}