{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:55:10Z","timestamp":1776956110044,"version":"3.51.4"},"reference-count":12,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,6,1]],"date-time":"2008-06-01T00:00:00Z","timestamp":1212278400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Probl Inf Transm"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1134\/s0032946008020038","type":"journal-article","created":{"date-parts":[[2008,7,10]],"date-time":"2008-07-10T07:49:55Z","timestamp":1215676195000},"page":"99-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Self-checking circuits and decoding algorithms for binary hamming and BCH codes and Reed-Solomon codes over GF(2\n                m\n              )"],"prefix":"10.1134","volume":"44","author":[{"given":"I. M.","family":"Boyarinov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2008,7,11]]},"reference":[{"issue":"1","key":"2003_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1002\/scj.4690180105","volume":"18","author":"S. Shinmory","year":"1987","unstructured":"Shinmory, S., Hoda, M., and Koga, Y., Realization Method of Totally Self-checking Error Checking and Correcting Circuits for Main Memory Systems, Syst. Comput. Japan, 1987, vol. 18, no. 1, pp. 42\u201354.","journal-title":"Syst. Comput. Japan"},{"issue":"3","key":"2003_CR2","first-page":"23","volume":"22","author":"I.M. Boyarinov","year":"1993","unstructured":"Boyarinov, I.M., Totally Self-checking and Self-correcting LSI Circuits for Encoders and Decoders of Modified Hamming Codes, Mikroelektronika, 1993, vol. 22, no. 3, pp. 23\u201336.","journal-title":"Mikroelektronika"},{"key":"2003_CR3","doi-asserted-by":"crossref","unstructured":"Boyarinov, I.M., Totally Self-checking Decoders for Hamming SEC Codes, in Proc. 2000 IEEE Int. Symp. on Information Theory, Sorrento, Italy, p. 397.","DOI":"10.1109\/ISIT.2000.866695"},{"issue":"1","key":"2003_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1109\/TC.1987.1676864","volume":"36","author":"G.R. Redinbo","year":"1987","unstructured":"Redinbo, G.R., Fault-Tolerant Decoders for Cyclic Error-Correcting Codes, IEEE Trans. Computers, 1987, vol. 36, no. 1, pp. 47\u201363.","journal-title":"IEEE Trans. Computers"},{"key":"2003_CR5","series-title":"Lect. Notes Comp. Sci.","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/3-540-58265-7_8","volume-title":"Error Control, Cryptology, and Speech Compression (Workshop on Information Protection, Moscow, Russia, 1993: Selected Papers)","author":"I.M. Boyarinov","year":"1994","unstructured":"Boyarinov, I.M., Self-checking Decoding Algorithm for Reed-Solomon Codes, Error Control, Cryptology, and Speech Compression (Workshop on Information Protection, Moscow, Russia, 1993: Selected Papers), Chmora, A. and Wicker, S.B., Eds., Lect. Notes Comp. Sci., vol. 829, Berlin: Springer, 1994, pp. 63\u201368."},{"key":"2003_CR6","volume-title":"Logic Design Principles: with Emphasis on Testable Semicustom Circuits","author":"E.J. McCluskey","year":"1986","unstructured":"McCluskey, E.J., Logic Design Principles: with Emphasis on Testable Semicustom Circuits, Englewood Cliffs: Prentice-Hall, 1986."},{"issue":"6","key":"2003_CR7","doi-asserted-by":"publisher","first-page":"1506","DOI":"10.1109\/T-C.1971.223163","volume":"20","author":"J.P. Hayes","year":"1971","unstructured":"Hayes, J.P., On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of Tests, IEEE Trans. Computers, 1971, vol. 20, no. 6, pp. 1506\u20131513.","journal-title":"IEEE Trans. Computers"},{"key":"2003_CR8","volume-title":"Error-Control Coding for Computer Systems","author":"T.R.N. Rao","year":"1989","unstructured":"Rao, T.R.N. and Fujiwara, E., Error-Control Coding for Computer Systems, Englewood Cliffs: Prentice-Hall, 1989."},{"issue":"6","key":"2003_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1109\/TC.1978.1675139","volume":"27","author":"J.E. Smith","year":"1978","unstructured":"Smith, J.E. and Metze, G., Strongly Fault Secure Logic Networks, IEEE Trans. Computers, 1978, vol. 27, no. 6, pp. 491\u2013499.","journal-title":"IEEE Trans. Computers"},{"key":"2003_CR10","volume-title":"Error-Correcting Codes","author":"W.W. Peterson","year":"1972","unstructured":"Peterson, W.W. and Weldon, E.J., Jr., Error-Correcting Codes, Cambridge: MIT Press, 1972. Translated under the title Kody, ispravlyayushchie oshibki, Moscow: Mir, 1976."},{"key":"2003_CR11","volume-title":"The Theory of Information and Coding: A Mathematical Framework for Communication","author":"R.J. McEliece","year":"1977","unstructured":"McEliece, R.J., The Theory of Information and Coding: A Mathematical Framework for Communication, Reading: Addison-Wesley, 1977."},{"key":"2003_CR12","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."}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946008020038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946008020038","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946008020038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946008020038.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:01:32Z","timestamp":1775008892000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946008020038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["2003"],"URL":"https:\/\/doi.org\/10.1134\/s0032946008020038","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,6]]},"assertion":[{"value":"2 October 2007","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2008","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2008","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}