EDBT 2026 Demo / reviewers in the wild / expert

Enrique Figueroa-Lopez

dblp:43/3667 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2005
—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 · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
block codes		 0.112005
On the asymptotic redundancy of lossless block coding with two codeword lengths · IEEE Trans. Inf. Theory 2005
Coding theory › source coding
lossless compression		 0.112005
On the asymptotic redundancy of lossless block coding with two codeword lengths · IEEE Trans. Inf. Theory 2005
Coding theory
source coding		 0.112005
On the asymptotic redundancy of lossless block coding with two codeword lengths · IEEE Trans. Inf. Theory 2005

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

large-deviation inequalities · 0.1
YearPublicationVenuePosition
2005 On the asymptotic redundancy of lossless block coding with two codeword lengths
abstract
With the additional constraint of requiring only two codeword lengths, lossless codes of blocks of size n generated by stationary memoryless binary sources are studied. For arbitrary /spl delta/>0, classical large-deviation inequalities imply the existence of codes attaining an expected redundancy of the order O(n/sup -1/2+/spl delta//). It is shown that it is not possible to construct lossless codes with two codeword lengths having rate of order better or equal to O(n/sup -1/2/).
Enrique Figueroa-Lopez, Christian Houdré
 IEEE Trans. Inf. Theory1