{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,17]],"date-time":"2026-09-17T21:07:50Z","timestamp":1789679270109,"version":"4.0.1"},"reference-count":36,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1985,8]]},"abstract":"<jats:p>The Berlekamp\u2013Massey algorithm takes a sequence of elements from a field and finds the shortest linear recurrence (or linear feedback shift register) that can generate the sequence. In this paper we extend the algorithm to the case when the elements of the sequence are integers modulo m, where m is an arbitrary integer with known prime decomposition.<\/jats:p>","DOI":"10.1137\/0214038","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:25:35Z","timestamp":1109226335000},"page":"505-513","source":"Crossref","is-referenced-by-count":64,"title":["Shift Register Synthesis (Modulo\n                    <i>m<\/i>\n                    )"],"prefix":"10.1137","volume":"14","author":[{"given":"J. A.","family":"Reeds","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"N. J. A.","family":"Sloane","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,8,2]]},"reference":[{"key":"R1","volume-title":"Algebraic coding theory","author":"Berlekamp Elwyn R.","year":"1968"},{"key":"R2","first-page":"305","volume":"5","author":"Berlekamp E. R.","year":"1974","journal-title":"Utilitas Math."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90223-9"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)80001-5"},{"key":"R5","volume-title":"Algorithm 288 in Collected Algorithms from ACM, 2 Vols.","author":"Blankinship W. A.","year":"1978"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90013-9"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1137\/0139009"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1976.1093307"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1974.1100457"},{"key":"R10","first-page":"317","volume":"5","author":"Dillon J. F.","year":"1974","journal-title":"Utilitas Math."},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056619"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/1014001"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1147\/rd.203.0204"},{"key":"R14","unstructured":"P. Henrici,  A.  Ralston, H.  Wilf,  Quotient-difference algorithms,  Mathematical Methods for Digital Computers II, John Wiley, New York,  35\u201362"},{"key":"R15","volume-title":"Continued Fractions: Analytic Theory and Applications","author":"Jones William B.","year":"1980"},{"key":"R16","volume-title":"Linear algebra","author":"Lang Serge","year":"1971"},{"key":"R17","unstructured":"W. F. Lunnon,  Linear recurring sequences over the complex numbers,  1970, unpublished manuscript"},{"key":"R18","volume-title":"The theory of information and coding","author":"McEliece Robert J.","year":"1977"},{"key":"R19","volume-title":"The theory of error-correcting codes. I","author":"MacWilliams F. J.","year":"1977"},{"key":"R19","volume-title":"The theory of error-correcting codes. II","author":"MacWilliams F. J.","year":"1977"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055667"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1975-0369276-7"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055350"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.73"},{"key":"R25","unstructured":"J. B. Plumstead, Masters Thesis,  Inferring sequences produced by pseudo-random number generators, Ph.D. dissertation, Computer Science Dept., Univ. California, Berkeley,  1983"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90496-9"},{"key":"R27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055732"},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056063"},{"key":"R29","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39466-4_6"},{"key":"R30","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(77)90526-5"},{"key":"R31","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(78)90461-8"},{"key":"R32","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(75)90090-X"},{"key":"R33","unstructured":"K. K. Tzeng, G. L. Feng,  Shift-register synthesis for\n                      t\n                      sequences, preprint"},{"key":"R34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1055987"},{"key":"R35","first-page":"47","volume-title":"Error Correcting Codes (Proc. Sympos. Math. Res. Center, Madison, Wis., 1968)","author":"Zierler Neal","year":"1968"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0214038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:00Z","timestamp":1787337540000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0214038"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["10.1137\/0214038"],"URL":"https:\/\/doi.org\/10.1137\/0214038","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}