Jean Louis Dornstetter

dblp:71/6848 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1987
—ORCID · none

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

Theory of computation · 1 · 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 · 75% Algorithms and data structures · 25%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory
0.011987
On the equivalence between Berlekamp's and Euclid's algorithms · IEEE Trans. Inf. Theory 1987
Coding theory › error-correcting codes › decoding › decoding algorithms
berlekamp's algorithm
0.011987
On the equivalence between Berlekamp's and Euclid's algorithms · IEEE Trans. Inf. Theory 1987
Coding theory › error-correcting codes › decoding
decoding algorithms
0.011987
On the equivalence between Berlekamp's and Euclid's algorithms · IEEE Trans. Inf. Theory 1987
Algorithms and data structures › number-theoretic algorithms
euclidean algorithm
0.011987
On the equivalence between Berlekamp's and Euclid's algorithms · IEEE Trans. Inf. Theory 1987

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

iterative algorithm derivation · 0.0extended euclidean algorithm · 0.0
YearPublicationVenuePosition
1987 On the equivalence between Berlekamp's and Euclid's algorithms
abstract
It is shown that Berlekamp's iterative algorithm can be derived from a normalized version of Euclid's extended algorithm. Simple proofs of the results given recently by Cheng are also presented.
Jean Louis Dornstetter
IEEE Trans. Inf. Theory1