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.

Jia-Yu Lin

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

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

Computer networks · 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%
Computer graphics and multimedia
1 paper
Image and video coding · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › source coding › variable-length codes › prefix codes
huffman coding
0.012004
Balance of 0, 1 bits for Huffman and reversible variable-length coding · IEEE Trans. Commun. 2004
Coding theory › source coding › variable-length codes
reversible variable-length codes
0.012004
Balance of 0, 1 bits for Huffman and reversible variable-length coding · IEEE Trans. Commun. 2004
Coding theory › source coding
variable-length codes
0.012004
Balance of 0, 1 bits for Huffman and reversible variable-length coding · IEEE Trans. Commun. 2004

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

combinatorial optimization · 0.1
YearPublicationVenuePosition
2004 Balance of 0, 1 bits for Huffman and reversible variable-length coding
abstract
This letter proposes a novel algorithm to obtain a suboptimal solution for the balance of bit distribution after Huffman coding. The algorithm is simple, and can be embedded in the conventional Huffman coding process. In addition, the letter also discusses the bit-balance problem for reversible variable-length codes (RVLCs) based on Huffman coding. Analytical and experimental results suggest that the new algorithm is very useful in improving the 0/1 balance property for Huffman codes and RVLCs.
Jia-Yu Lin, Ke-Chu Yi
IEEE Trans. Commun.1