On the public citation graph
On the matrix berlekamp-massey algorithm
0 signed · 52 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.1002/sapm1946251261openalex-snapshot
The Wiener (Root Mean Square) Error Criterion in Filter Design and Prediction
inferredcites →https://doi.org/10.1006/jsco.2002.0533openalex-snapshot
Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm
inferredcites →https://doi.org/10.1007/3-540-54522-0_93openalex-snapshot
On wiedemann's method of solving sparse linear systems
inferredcites →https://doi.org/10.1007/bf02141952openalex-snapshot
A general module theoretic framework for vector M-Padé and matrix rational interpolation
inferredcites →https://doi.org/10.1007/bf02142327openalex-snapshot
The computation of non-perfect Padé-Hermite approximants
inferredcites →https://doi.org/10.1007/bfb0059934openalex-snapshot
Some properties of the control systems with irreducible matrix — Transfer functions
inferredcites →https://doi.org/10.1007/s00037-004-0185-3openalex-snapshot
On the complexity of computing determinants
inferredcites →https://doi.org/10.1016/0196-6774(80)90013-9openalex-snapshot
Fast solution of toeplitz systems of equations and computation of Padé approximants
inferredcites →https://doi.org/10.1016/s0019-9958(75)90090-xopenalex-snapshot
A method for solving key equation for decoding goppa codes
inferredcites →https://doi.org/10.1016/s0747-7171(03)00087-7openalex-snapshot
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
inferredcites →https://doi.org/10.1016/s0747-7171(03)00088-9openalex-snapshot
Early termination in sparse interpolation algorithms
inferredcites →https://doi.org/10.1109/tac.1974.1100457openalex-snapshot
A minimal realization algorithm for matrix sequences
inferredcites →https://doi.org/10.1109/tit.1969.1054260openalex-snapshot
Shift-register synthesis and BCH decoding
inferredcites →https://doi.org/10.1109/tit.1986.1057137openalex-snapshot
Solving sparse linear equations over finite fields
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.1137/0219006openalex-snapshot
The Inverses of Block Hankel and Block Toeplitz Matrices
inferredcites →https://doi.org/10.1137/s0895479892230031openalex-snapshot
A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
inferredcites →https://doi.org/10.1145/143242.143350openalex-snapshot
On computing determinants of matrices without divisions
inferredcites →https://doi.org/10.1145/258726.258742openalex-snapshot
Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract)
inferredcites →https://doi.org/10.1145/780506.780519openalex-snapshot
Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm
inferredcites →https://doi.org/10.1145/860854.860889openalex-snapshot
On the complexity of polynomial matrix computations
inferredcites →https://doi.org/10.2307/2153413openalex-snapshot
Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
inferredcites →https://doi.org/10.2307/2153451openalex-snapshot
Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cta.70556openalex-snapshot
A Cryptolocker‐Resistant and Reconfigurable Hardware Data Compressor Design for Artificial Intelligence (AI) Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-26831-2_24openalex-snapshot
On Berlekamp–Massey and Berlekamp–Massey–Sakata Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-7091-0794-2_5openalex-snapshot
The “Seven Dwarfs” of Symbolic Computation
inferred← citeshttps://doi.org/10.1007/s11432-015-5302-1openalex-snapshot
On the matrix feedback shift register synthesis for matrix sequences
inferred← citeshttps://doi.org/10.1016/j.jco.2023.101803openalex-snapshot
High-order lifting for polynomial Sylvester matrices
inferred← citeshttps://doi.org/10.1016/j.jsc.2011.09.008openalex-snapshot
On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field
inferred← citeshttps://doi.org/10.1016/j.jsc.2015.06.005openalex-snapshot
Probabilistic analysis of Wiedemann's algorithm for minimal polynomial computation
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.06.005openalex-snapshot
Probabilistic analysis of block Wiedemann for leading invariant factors
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102507openalex-snapshot
Early termination for sparse interpolation of polynomials in Chebyshev bases
inferred← citeshttps://doi.org/10.1016/j.laa.2013.06.016openalex-snapshot
A fraction free Matrix Berlekamp/Massey algorithm
inferred← citeshttps://doi.org/10.1016/j.laa.2018.06.009openalex-snapshot
Linear feedback shift registers and the minimal realization problem
inferred← citeshttps://doi.org/10.1109/jcice61382.2024.00018openalex-snapshot
A Word-oriented Code on Galois Field with Accurate Period
inferred← citeshttps://doi.org/10.1109/tns.2023.3285251openalex-snapshot
A Linear Recurrence-Based Pseudorandom Number Generator Optimized for Detector Emulators
inferred← citeshttps://doi.org/10.1145/2442829.2442852openalex-snapshot
Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values
inferred← citeshttps://doi.org/10.1145/2576802.2576813openalex-snapshot
Relaxing order basis computation
inferred← citeshttps://doi.org/10.1145/2608628.2608647openalex-snapshot
Online order basis algorithm and its impact on the block Wiedemann algorithm
inferred← citeshttps://doi.org/10.1145/2755996.2756673openalex-snapshot
Linear Algebra for Computing Gröbner Bases of Linear Recursive Multidimensional Sequences
inferred← citeshttps://doi.org/10.1145/3452143.3465542openalex-snapshot
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices
inferred← citeshttps://doi.org/10.1145/3476446.3535501openalex-snapshot
Sparse Polynomial Hermite Interpolation
inferred← citeshttps://doi.org/10.1145/3666000.3672619openalex-snapshot
Encounters in Symbolic Computation: Ideas for the Ages
inferred← citeshttps://doi.org/10.14429/dsj.72.17656openalex-snapshot
Solution of Large Sparse System of Linear Equations over GF(2) on a Multi Node Multi GPU Platform
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
inferred← citeshttps://doi.org/10.48550/arxiv.2104.02497openalex-snapshot
Computing the Characteristic Polynomial of Generic Toeplitz-like and Hankel-like Matrices
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.