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

Shang Xue

dblp:50/6693 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › source coding
entropy coding
0.112006
Unary Prefixed Huffman Coding for a Group of Quantized Generalized Gaussian Sources · IEEE Trans. Commun. 2006
Coding theory › source coding › variable-length codes › prefix codes
huffman coding
0.112006
Unary Prefixed Huffman Coding for a Group of Quantized Generalized Gaussian Sources · IEEE Trans. Commun. 2006
Coding theory
source coding
0.112006
Unary Prefixed Huffman Coding for a Group of Quantized Generalized Gaussian Sources · IEEE Trans. Commun. 2006
Coding theory › source coding
variable-length codes
0.112006
Unary Prefixed Huffman Coding for a Group of Quantized Generalized Gaussian Sources · IEEE Trans. Commun. 2006
Coding theory › source coding › rate-distortion theory
generalized gaussian source
0.012006
Unary Prefixed Huffman Coding for a Group of Quantized Generalized Gaussian Sources · IEEE Trans. Commun. 2006

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

unary prefix coding · 0.1entropy bounds · 0.1
YearPublicationVenuePosition
2006 Unary Prefixed Huffman Coding for a Group of Quantized Generalized Gaussian Sources
abstract
We propose a coding algorithm called unary prefixed Huffman (UPH) coding for a family of infinite sources called quantized generalized Gaussian (GG) sources. Compared with the existing codes for these GG sources, the UPH algorithm provides a more adaptive approach, and its coding efficiency is upper bounded by entropy +2.
Shang Xue, Bengt Oelmann
IEEE Trans. Commun.1
2003 Alternating coding for universal variable length code
abstract
Variable length code (VLC) is used in a large variety of lossless compression applications. A specially designed VLC, called "universal variable length code" (UVLC), is utilized in the latest video coding standard H.26L under development. In this work we propose a new coding method under the name "alternating coding" (ALT coding) and apply it to the UVLC. The ALT coded UVLC yields the same high coding efficiency as the original UVLC, but ALT coding also enables immediate decoding, immediate error detection and location in a UVLC packet. It improves the error resiliency and error robustness of the UVLC packet by applying an "error speculation". Results show that the ALT coded UVLC packet always outperforms the original UVLC packet in terms of error resiliency and robustness. Moreover, the simple pattern of ALT coded UVLC can greatly simplify the UVLC decoder architecture and therefore enables small, fast, and low-power decoder design.
Shang Xue, Bengt Oelmann
ICIP (3)1