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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Emmanuelle Delpeyroux

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

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

Theory of computation · 1

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 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
cyclic codes		 0.012002
The q-ary image of some qm-ary cyclic codes: Permutation group and soft-decision decoding · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes
reed-solomon codes		 0.012002
The q-ary image of some qm-ary cyclic codes: Permutation group and soft-decision decoding · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes › decoding
soft-decision decoding		 0.012002
The q-ary image of some qm-ary cyclic codes: Permutation group and soft-decision decoding · IEEE Trans. Inf. Theory 2002
Coding theory › error-correcting codes › algebraic coding theory
abelian codes		 0.012002
The q-ary image of some qm-ary cyclic codes: Permutation group and soft-decision decoding · IEEE Trans. Inf. Theory 2002

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

permutation group · 0.0generalized minimum distance decoding · 0.0
YearPublicationVenuePosition
2002 The q-ary image of some qm-ary cyclic codes: Permutation group and soft-decision decoding
abstract
Using a particular construction of generator matrices of the q-ary image of q/sup m/-ary cyclic codes, it is proved that some of these codes are invariant under the action of particular permutation groups. The equivalence of such codes with some two-dimensional (2-D) Abelian codes and cyclic codes is deduced from this property. These permutations are also used in the area of the soft-decision decoding of some expanded Reed-Solomon (RS) codes to improve the performance of generalized minimum-distance decoding.
Jérôme Lacan, Emmanuelle Delpeyroux
 IEEE Trans. Inf. Theory2