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

Claude Le Dantec

dblp:67/5941 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2006
—ORCID · none

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

Theory of computation · 4 · 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
3 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes		 0.012003
Bolt interleavers for turbo codes · IEEE Trans. Inf. Theory 2003
Coding theory › channel coding › turbo codes
interleaver design		 0.012003
Bolt interleavers for turbo codes · IEEE Trans. Inf. Theory 2003
Coding theory › channel coding
turbo codes		 0.012003
Bolt interleavers for turbo codes · IEEE Trans. Inf. Theory 2003
Coding theory
finite fields		 0.012001
Permutations preserving divisibility · IEEE Trans. Inf. Theory 2001
Coding theory › error-correcting codes › block codes › linear code
polynomial codes		 0.012001
Permutations preserving divisibility · IEEE Trans. Inf. Theory 2001
Coding theory › error-correcting codes › code construction › channel code design
encoder design		 0.011999
An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q) · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes
reed-solomon codes		 0.011999
An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q) · IEEE Trans. Inf. Theory 1999

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

minimum distance optimization · 0.0bolt interleaver construction · 0.0polynomial divisibility · 0.0finite field subspace mapping · 0.0
YearPublicationVenuePosition
2006 Correction to "Bolt Interleavers for Turbo Codes"
P. Le Bars, Claude Le Dantec, Philippe Piret
 IEEE Trans. Inf. Theory2
2003 Bolt interleavers for turbo codes
abstract
A procedure is described to produce efficient turbo-code interleavers. It is well suited to the selection of interleavers that produce a large minimum distance for the resulting turbo codes. A feature of these interleavers is that the final state of the two elementary encoders is simultaneously zero. Examples are given and the corresponding codes are simulated. They seem to be among the best ones for rate 1/3 turbo codes.
P. Le Bars, Claude Le Dantec, Philippe Piret
 IEEE Trans. Inf. Theory2
2001 Permutations preserving divisibility
abstract
We give a proof of a theorem on the common divisibility of polynomials and permuted polynomials (over GF(2)) by a polynomial g(x).
Robert J. McEliece, Claude Le Dantec, Philippe Piret
 IEEE Trans. Inf. Theory2
1999 An encoder to match Reed-Solomon codes over GF(q) to a subalphabet of GF(q)
abstract
One describes procedures to generate the codewords of a Reed-Solomon code over GF(2/sup m/) having all their symbols in a GF(2) subspace of GF(2/sup m/). Some of the described encoders are systematic binary encoders and some are only partly systematic.
Claude Le Dantec, Philippe Piret
 IEEE Trans. Inf. Theory1