On the public citation graph
The Berlekamp-Massey Algorithm and Linear Recurring Sequences Over a Factorial Domain
0 signed · 26 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-3-7091-3406-1_9openalex-snapshot
Generalized Polynomial Remainder Sequences
inferredcites →https://doi.org/10.1007/bfb0019862openalex-snapshot
Linear recurrence relations and an extended subresultant algorithm
inferredcites →https://doi.org/10.1017/cbo9780511606267openalex-snapshot
The Theory of Information and Coding
inferredcites →https://doi.org/10.1049/el:19910062openalex-snapshot
Linear recurring sequences and the path weight enumerator of a convolutional code
inferredcites →https://doi.org/10.1109/18.59953openalex-snapshot
Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.1109/tit.1987.1057299openalex-snapshot
On the equivalence between Berlekamp's and Euclid's algorithms (Corresp.)
inferredcites →https://doi.org/10.1145/321371.321381openalex-snapshot
Subresultants and Reduced Polynomial Remainder Sequences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1995.1040openalex-snapshot
On the Minimal Realizations of a Finite Sequence
inferred← citeshttps://doi.org/10.1007/3-540-44670-2_15openalex-snapshot
Multisequence Synthesis over an Integral Domain
inferred← citeshttps://doi.org/10.1007/3-540-46796-3_36openalex-snapshot
Linear Codes and Polylinear Recurrences over Finite Rings and Modules (A Survey)
inferred← citeshttps://doi.org/10.1007/978-3-0348-8970-4_15openalex-snapshot
The Berlekamp-Massey algorithm, error-correction, keystreams and modeling
inferred← citeshttps://doi.org/10.1007/bf02871837openalex-snapshot
Gröbner bases of characteristic ideals of LRS over UFD
inferred← citeshttps://doi.org/10.1109/18.272482openalex-snapshot
The n-dimensional key equation and a decoding application
inferred← citeshttps://doi.org/10.1109/18.59953openalex-snapshot
Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
inferred← citeshttps://doi.org/10.1109/26.387421openalex-snapshot
A new algebraic algorithm for generating the transfer function of a trellis encoder
inferred← citeshttps://doi.org/10.1109/asap.1990.145480openalex-snapshot
An improved systolic extended Euclidean algorithm for Reed-Solomon decoding: design and implementation
inferred← citeshttps://doi.org/10.4213/dm446openalex-snapshot
Алгоритм Берлекэмпа - Месси над конечными кольцами, модулями и бимодулями
inferred← citeshttps://doi.org/10.48550/arxiv.1001.1597openalex-snapshot
The Berlekamp-Massey Algorithm via Minimal Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1002.0179openalex-snapshot
Bézout Identities Associated to a Finite Sequence
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.