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

Liuyang Yang

dblp:41/5637 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
0since 2021 · last 2019
0000-0002-4525-4050ORCID · corroborated

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

Theory of computation · 2 · 2 first-authorApplied, interdisciplinary, general and emerging computing · 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
2 papers
Coding theory · 94% Information theory · 6%

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

TopicWeightPapersLastEvidence papers
Coding theory
source coding
0.021999
Trellis-Coded Quantization for Binary Erasure Channels · IEEE Trans. Inf. Theory 1999
A New Trellis Source Code for Memoryless Sources · IEEE Trans. Inf. Theory 1998
Coding theory › source coding › quantization › structured vector quantization
trellis-coded quantization
0.021999
Trellis-Coded Quantization for Binary Erasure Channels · IEEE Trans. Inf. Theory 1999
A New Trellis Source Code for Memoryless Sources · IEEE Trans. Inf. Theory 1998
Information theory › communication channels › channel models › binary-input channel
binary erasure channel
0.011999
Trellis-Coded Quantization for Binary Erasure Channels · IEEE Trans. Inf. Theory 1999
Coding theory
channel coding
0.011999
Trellis-Coded Quantization for Binary Erasure Channels · IEEE Trans. Inf. Theory 1999

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

channel-optimized quantization · 0.0trellis-coded quantization · 0.0scalar-vector quantization · 0.0
YearPublicationVenuePosition
2019 A Coherence Algorithm for 3-D Seismic Data Analysis Based on the Mutual Information
abstract
Coherence algorithm is widely used to describe geological discontinuity and subtle features of seismic data. Traditional coherence algorithms often use the linear correlation measurement to measure the relationship between two seismic traces. It does not work well because seismic data do not obey the normal distribution. To describe the coherence measurement of seismic data, we propose an improved coherence algorithm by combining the mutual information (MI) and third-generation coherence (C3) algorithm. The MI is a measurement of the general dependence and used to describe nonlinear relationships between two variables. Note that, the MI does not require that variables obey specific distribution (e.g., the normal distribution). Note that, we calculate precise MI values using the copula function. In addition, we introduce the information divergence to save calculation time by replacing the eigenvalue decomposition of the C3 algorithm. To demonstrate the effectiveness of the proposed algorithm, we apply it to field data. Field data experiments demonstrate the effectiveness of the proposed algorithm to describe geological discontinuity and heterogeneity, such as channels with different thicknesses.
Liuyang Yang, Jinghuai Gao, Naihao Liu, Xiudi Jiang
IEEE Geosci. Remote. Sens. Lett.1
1999 Trellis-Coded Quantization for Binary Erasure Channels
abstract
Trellis-coded quantizers (TCQ) are designed for the binary erasure channel (BEC) for memoryless sources. When the bit erasure rate is large, the channel-optimized TCQ can provide up to 1.4 dB improvement over TCQ designed for a lossless channel.
Liuyang Yang, Thomas R. Fischer
IEEE Trans. Inf. Theory1
1998 A New Trellis Source Code for Memoryless Sources
abstract
The trellis-based scalar-vector quantizer (TB-SVQ) for memoryless sources combines the scalar-vector quantizer (SVQ) with trellis coded quantization (TCQ) to achieve both boundary gain and granular gain. The resulting quantizer outperforms all other reasonable complexity fixed-rate quantizers. Unfortunately, the resulting code is catastrophic-a single bit error within a block can propagate indefinitely into other blocks. This correspondence presents a new trellis source code that can achieve essentially the same, or in some cases better, performance as the TB-SVQ for error-free channels, but limits the propagation of channel errors.
Liuyang Yang, Thomas R. Fischer
IEEE Trans. Inf. Theory1