On the public citation graph
Finding a basis for the characteristic ideal of an n-dimensional linear recurring sequence
0 signed · 32 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-94-009-5225-6_6openalex-snapshot
Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory
inferredcites →https://doi.org/10.1007/bf01235722openalex-snapshot
The Berlekamp-Massey Algorithm and Linear Recurring Sequences Over a Factorial Domain
inferredcites →https://doi.org/10.1007/bfb0019862openalex-snapshot
Linear recurrence relations and an extended subresultant algorithm
inferredcites →https://doi.org/10.1016/0012-365x(85)90032-9openalex-snapshot
Important algebraic calculations for n-variables polynomial codes
inferredcites →https://doi.org/10.1016/0890-5401(90)90039-kopenalex-snapshot
Extension of the Berlekamp-Massey algorithm to N dimensions
inferredcites →https://doi.org/10.1016/s0019-9958(77)90232-7openalex-snapshot
A theory of two-dimensional cyclic codes
inferredcites →https://doi.org/10.1016/s0195-6698(81)80010-8openalex-snapshot
Codes Autoduaux Principaux et Groupe d'Automorphismes de l'Algèbre A = F2r, [X1, -, Xn]/(X12 - 1, -, Xn2 -1)
inferredcites →https://doi.org/10.1016/s0747-7171(88)80033-6openalex-snapshot
Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
inferredcites →https://doi.org/10.1016/s0747-7171(88)80039-7openalex-snapshot
On the complexity of computing syzygies
inferredcites →https://doi.org/10.1080/00927878408823009openalex-snapshot
Ideaux principaux nilpoitnis de dimension maximale dans l'algebre Fq[G] d'un groupe abelien fini g
inferredcites →https://doi.org/10.1109/tassp.1982.1163841openalex-snapshot
Impulse response arrays of discrete-space systems over a finite field
inferredcites →https://doi.org/10.1109/tit.1972.1054914openalex-snapshot
A theory of two-dimensional linear recurring arrays
inferredcites →https://doi.org/10.1109/tit.1978.1055964openalex-snapshot
General theory of doubly periodic arrays over an arbitrary finite field and its applications
inferredcites →https://doi.org/10.1109/tit.1981.1056396openalex-snapshot
On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
inferredcites →https://doi.org/10.2307/2007638openalex-snapshot
Encyclopedia of Mathematics and its Applications.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf01235722openalex-snapshot
The Berlekamp-Massey Algorithm and Linear Recurring Sequences Over a Factorial Domain
inferred← citeshttps://doi.org/10.1007/s10208-017-9372-xopenalex-snapshot
Polynomial–Exponential Decomposition From Moments
inferred← citeshttps://doi.org/10.1016/j.jsc.2016.11.005openalex-snapshot
Linear algebra for computing Gröbner bases of linear recursive multidimensional sequences
inferred← citeshttps://doi.org/10.1016/j.jsc.2019.09.001openalex-snapshot
In-depth comparison of the Berlekamp–Massey–Sakata and the Scalar-FGLM algorithms: The adaptive variants
inferred← citeshttps://doi.org/10.1016/j.jsc.2021.07.002openalex-snapshot
Polynomial-division-based algorithms for computing linear recurrence relations
inferred← citeshttps://doi.org/10.1016/j.jsc.2021.11.001openalex-snapshot
Guessing Gröbner bases of structured ideals of relations of sequences
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.476214openalex-snapshot
On the decoding of algebraic-geometric codes
inferred← citeshttps://doi.org/10.1145/2930889.2930926openalex-snapshot
Guessing Linear Recurrence Relations of Sequence Tuplesand P-recursive Sequences with Linear Algebra
inferred← citeshttps://doi.org/10.1145/3087604.3087632openalex-snapshot
Fast Algorithm for Border Bases of Artinian Gorenstein Algebras
inferred← citeshttps://doi.org/10.1145/3208976.3209017openalex-snapshot
A Polynomial-Division-Based Algorithm for Computing Linear Recurrence Relations
inferred← citeshttps://doi.org/10.1145/3452143.3465533openalex-snapshot
Algorithms for Linearly Recurrent Sequences of Truncated Polynomials
inferred← citeshttps://doi.org/10.4213/dm446openalex-snapshot
Алгоритм Берлекэмпа - Месси над конечными кольцами, модулями и бимодулями
inferred← citeshttps://doi.org/10.48550/arxiv.1709.07168openalex-snapshot
In-depth comparison of the Berlekamp -- Massey -- Sakata and the Scalar-FGLM algorithms: the non adaptive variants
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.