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

Yuh-Jue Chuang

dblp:50/6488 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2008
0000-0002-3877-0161ORCID · corroborated

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

Computer networks · 2

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
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding › variable-length codes
average codeword length minimization		 0.222008
Two algorithms for constructing efficient huffman-code based reversible variable length codes · IEEE Trans. Commun. 2008
Two Algorithms for Constructing Efficient Huffman-Code-Based Reversible Variable Length Codes · IEEE Trans. Commun. 2007
Coding theory › error-correcting codes
code construction		 0.222008
Two algorithms for constructing efficient huffman-code based reversible variable length codes · IEEE Trans. Commun. 2008
Two Algorithms for Constructing Efficient Huffman-Code-Based Reversible Variable Length Codes · IEEE Trans. Commun. 2007
Coding theory › source coding › variable-length codes › prefix codes
huffman coding		 0.222008
Two algorithms for constructing efficient huffman-code based reversible variable length codes · IEEE Trans. Commun. 2008
Two Algorithms for Constructing Efficient Huffman-Code-Based Reversible Variable Length Codes · IEEE Trans. Commun. 2007
Coding theory › source coding › variable-length codes
reversible variable-length codes		 0.222008
Two algorithms for constructing efficient huffman-code based reversible variable length codes · IEEE Trans. Commun. 2008
Two Algorithms for Constructing Efficient Huffman-Code-Based Reversible Variable Length Codes · IEEE Trans. Commun. 2007
Coding theory
source coding		 0.222008
Two algorithms for constructing efficient huffman-code based reversible variable length codes · IEEE Trans. Commun. 2008
Two Algorithms for Constructing Efficient Huffman-Code-Based Reversible Variable Length Codes · IEEE Trans. Commun. 2007
Coding theory › source coding
variable-length codes		 0.222008
Two algorithms for constructing efficient huffman-code based reversible variable length codes · IEEE Trans. Commun. 2008
Two Algorithms for Constructing Efficient Huffman-Code-Based Reversible Variable Length Codes · IEEE Trans. Commun. 2007

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

graph modeling · 0.2
YearPublicationVenuePosition
2008 Two algorithms for constructing efficient huffman-code based reversible variable length codes
abstract
In this paper, Huffman-code based reversible variable length code (RVLC) construction algorithms are studied. We use graph models to represent the prefix, suffix and Hamming distance relationships among RVLC candidate codewords. The properties of the so-obtained graphs are investigated in detail, based on which we present two efficient RVLC construction algorithms: algorithm 1 aims at minimizing the average codeword length while algorithm 2 jointly minimizes the average codeword length and maximizes the error detection probability at the same time.
Chia-Wei Lin, Ja-Ling Wu, Yuh-Jue Chuang
 IEEE Trans. Commun.3
2007 Two Algorithms for Constructing Efficient Huffman-Code-Based Reversible Variable Length Codes
abstract
In this paper, Huffman-code-based reversible variable length code (RVLC) construction algorithms are studied. We use graph models to represent the prefix, suffix, and Hamming distance relationships among RVLC candidate code words. The properties of the so-obtained graphs are investigated in detail, based on which we present two efficient RVLC construction algorithms: Algorithm 1 aims at minimizing the average code word length while Algorithm 2 jointly minimizes the average code word length and maximizes the error-detection probability at the same time.
Chia-Wei Lin, Ja-Ling Wu, Yuh-Jue Chuang
 IEEE Trans. Commun.3