Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.
EDBT 2026 Demo / reviewers in the wild / expert

Agnes E. Heydtmann

dblp:38/5404 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › decoding
algebraic decoding		 0.012000
On the equivalence of the Berlekamp-Massey and the euclidean algorithms for decoding · IEEE Trans. Inf. Theory 2000
Coding theory › error-correcting codes › decoding › algebraic decoding
berlekamp-massey algorithm		 0.012000
On the equivalence of the Berlekamp-Massey and the euclidean algorithms for decoding · IEEE Trans. Inf. Theory 2000
Coding theory › error-correcting codes › decoding › algebraic decoding
key equation		 0.012000
On the equivalence of the Berlekamp-Massey and the euclidean algorithms for decoding · IEEE Trans. Inf. Theory 2000

Methods — techniques the papers use, named apart from their topics

fundamental iterative algorithm · 0.0euclidean algorithm · 0.0
YearPublicationVenuePosition
2000 On the equivalence of the Berlekamp-Massey and the euclidean algorithms for decoding
abstract
The Berlekamp-Massey (1968, 1969) algorithm (BMA) and the Euclidean algorithm (EA) for decoding have been considered as two different algorithms for solving the same problem, namely, the one given by the key equation. We argue that they are essentially identical by showing how one can be adapted to perform the same arithmetic as the other. As a tool we use Feng and Tzeng's (1991) fundamental iterative algorithm that when adapted to the syndrome matrix is regarded as equivalent to the BMA.
Agnes E. Heydtmann, Jørn M. Jensen
 IEEE Trans. Inf. Theory1
1998 Generating a Noetherian Normalization of the Invariant Ring of a Finite Group
Wolfram Decker, Agnes E. Heydtmann, Frank-Olaf Schreyer
 J. Symb. Comput.2