FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2029567033> ?p ?o ?g. }

• W2029567033 endingPage "353" @default.
• W2029567033 startingPage "342" @default.
• W2029567033 abstract "Previous article Next article Linear Recursive SequencesJay P. Fillmore and Morris L. MarxJay P. Fillmore and Morris L. Marxhttps://doi.org/10.1137/1010059PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] T. G. Birdsall and , M. P. Ristenbatt, Introduction to linear shift-register generated sequences, Tech. Rep., 90, Electronic Defense Group, Department of Electrical Engineering, University of Michigan, Ann Arbor, 1958 Google Scholar[2] W. A. Blankinship, Classroom Notes: A New Version of the Euclidean Algorith, Amer. Math. Monthly, 70 (1963), 742–745 MR1532251 CrossrefISIGoogle Scholar[3] T. L. Booth, An analytical representation of signals in sequential networks, Proc. Sympos. Math. Theory of Automata (New York, 1962), Polytechnic Press of Polytechnic Inst. of Brooklyn, Brooklyn, N.Y., 1963, 301–340 MR0175717 0216.56303 Google Scholar[4] B. Elspas, The theory of autonomous linear sequential networks, IRE Trans. Circuit Theory, CT-6 (1959), 45–60 CrossrefGoogle Scholar[5] Solomon W. Golomb, Shift register sequences, With portions co-authored by Lloyd R. Welch, Richard M. Goldstein, and Alfred W. Hales, Holden-Day Inc., San Francisco, Calif., 1967xiv+224 MR0242575 0267.94022 Google Scholar[6] W. Wesley Peterson, Error-correcting codes, The M.I.T. Press, Cambridge, Mass., 1961x+285 MR0121260 0105.32802 Google Scholar[7] E. S. Selmer, Linear recurrence relations over finite fields, Department of Mathematics, University of Bergen, Norway, 1966 Google Scholar[8] Neal Zierler, Linear recurring sequences, J. Soc. Indust. Appl. Math., 7 (1959), 31–48 10.1137/0107003 MR0101979 0096.33804 LinkISIGoogle Scholar[9] S. W. Golomb, Digital Communications, with Space Applications, Prentice-Hall, Englewood Cliffs, New Jersey, 1964 0143.41602 Google Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Some basic results on finite linear recurring sequence subgroupsFinite Fields and Their Applications, Vol. 73 | 1 Aug 2021 Cross Ref Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methodsComputational Optimization and Applications, Vol. 77, No. 3 | 23 September 2020 Cross Ref Stochastic Reformulations of Linear Systems: Algorithms and Convergence TheoryPeter Richtárik and Martin TakáčSIAM Journal on Matrix Analysis and Applications, Vol. 41, No. 2 | 21 April 2020AbstractPDF (742 KB)Weak and strong orders of linear recurring sequencesComputational and Applied Mathematics, Vol. 37, No. 3 | 13 November 2017 Cross Ref Neumann problem in a disk for fourth-order improperly elliptic equationsJournal of Mathematical Sciences, Vol. 231, No. 1 | 18 April 2018 Cross Ref Recursive sequences and polynomial congruencesInvolve, a Journal of Mathematics, Vol. 3, No. 2 | 11 August 2010 Cross Ref Random numbers for large-scale distributed Monte Carlo simulationsPhysical Review E, Vol. 75, No. 6 | 6 June 2007 Cross Ref Parallel random number generators for sequences uniformly distributed over any range of integersIEEE Transactions on Circuits and Systems I: Regular Papers, Vol. 53, No. 7 | 1 Jul 2006 Cross Ref Shifts on the HyperfiniteII1FactorJournal of Functional Analysis, Vol. 156, No. 1 | 1 Jun 1998 Cross Ref Matrices and the structure of random number sequencesLinear Algebra and its Applications, Vol. 67 | 1 Jun 1985 Cross Ref Concatenation Properties or δ-Sequences Over GF(2)Journal of Information and Optimization Sciences, Vol. 2, No. 2 | 1 Jan 1981 Cross Ref Binary and ternary signals with small cross correlationsInformation Sciences, Vol. 13, No. 1 | 1 Jan 1977 Cross Ref BibliographyThe Theory of Error-Correcting Codes | 1 Jan 1977 Cross Ref Pseudo-random sequences and arraysProceedings of the IEEE, Vol. 64, No. 12 | 1 Dec 1976 Cross Ref Decimation of Periodic SequencesSIAM Journal on Applied Mathematics, Vol. 21, No. 3 | 12 July 2006AbstractPDF (588 KB) Volume 10, Issue 3| 1968SIAM Review291-405 History Submitted:30 January 1967Published online:18 July 2006 InformationCopyright © 1968 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1010059Article page range:pp. 342-353ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics" @default.
• W2029567033 created "2016-06-24" @default.
• W2029567033 creator A5057365878 @default.
• W2029567033 creator A5058371999 @default.
• W2029567033 date "1968-07-01" @default.
• W2029567033 modified "2023-09-24" @default.
• W2029567033 title "Linear Recursive Sequences" @default.
• W2029567033 cites W2089514214 @default.
• W2029567033 cites W2122164576 @default.
• W2029567033 cites W2133087726 @default.
• W2029567033 doi "https://doi.org/10.1137/1010059" @default.
• W2029567033 hasPublicationYear "1968" @default.
• W2029567033 type Work @default.
• W2029567033 sameAs 2029567033 @default.
• W2029567033 citedByCount "28" @default.
• W2029567033 countsByYear W20295670332012 @default.
• W2029567033 countsByYear W20295670332014 @default.
• W2029567033 countsByYear W20295670332015 @default.
• W2029567033 countsByYear W20295670332017 @default.
• W2029567033 countsByYear W20295670332018 @default.
• W2029567033 countsByYear W20295670332019 @default.
• W2029567033 countsByYear W20295670332020 @default.
• W2029567033 countsByYear W20295670332021 @default.
• W2029567033 countsByYear W20295670332023 @default.
• W2029567033 crossrefType "journal-article" @default.
• W2029567033 hasAuthorship W2029567033A5057365878 @default.
• W2029567033 hasAuthorship W2029567033A5058371999 @default.
• W2029567033 hasConcept C114614502 @default.
• W2029567033 hasConcept C118615104 @default.
• W2029567033 hasConcept C136119220 @default.
• W2029567033 hasConcept C154945302 @default.
• W2029567033 hasConcept C202444582 @default.
• W2029567033 hasConcept C33923547 @default.
• W2029567033 hasConcept C41008148 @default.
• W2029567033 hasConcept C94375191 @default.
• W2029567033 hasConceptScore W2029567033C114614502 @default.
• W2029567033 hasConceptScore W2029567033C118615104 @default.
• W2029567033 hasConceptScore W2029567033C136119220 @default.
• W2029567033 hasConceptScore W2029567033C154945302 @default.
• W2029567033 hasConceptScore W2029567033C202444582 @default.
• W2029567033 hasConceptScore W2029567033C33923547 @default.
• W2029567033 hasConceptScore W2029567033C41008148 @default.
• W2029567033 hasConceptScore W2029567033C94375191 @default.
• W2029567033 hasIssue "3" @default.
• W2029567033 hasLocation W20295670331 @default.
• W2029567033 hasOpenAccess W2029567033 @default.
• W2029567033 hasPrimaryLocation W20295670331 @default.
• W2029567033 hasRelatedWork W1978042415 @default.
• W2029567033 hasRelatedWork W2017331178 @default.
• W2029567033 hasRelatedWork W2135173043 @default.
• W2029567033 hasRelatedWork W2335699373 @default.
• W2029567033 hasRelatedWork W241866648 @default.
• W2029567033 hasRelatedWork W2963339245 @default.
• W2029567033 hasRelatedWork W2976797620 @default.
• W2029567033 hasRelatedWork W3086542228 @default.
• W2029567033 hasRelatedWork W3107474891 @default.
• W2029567033 hasRelatedWork W4253321761 @default.
• W2029567033 hasVolume "10" @default.
• W2029567033 isParatext "false" @default.
• W2029567033 isRetracted "false" @default.
• W2029567033 magId "2029567033" @default.
• W2029567033 workType "article" @default.