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

Wei Liu 0017

dblp:49/3283-17 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · conflict

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

Theory of computation · 2 · 1 first-authorComputer networks · 1 · 1 first-authorDatabases, data management, data science and information retrieval · 1Applied, 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 · 66% Information theory · 34%

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

TopicWeightPapersLastEvidence papers
Information theory › information measures › multiterminal information measures
common information
0.212016
A Lossy Source Coding Interpretation of Wyner's Common Information · IEEE Trans. Inf. Theory 2016
Coding theory › source coding › multiterminal source coding
gray-wyner network
0.212016
A Lossy Source Coding Interpretation of Wyner's Common Information · IEEE Trans. Inf. Theory 2016
Coding theory › source coding
lossy source coding
0.212016
A Lossy Source Coding Interpretation of Wyner's Common Information · IEEE Trans. Inf. Theory 2016
Coding theory › source coding
multiterminal source coding
0.212016
A Lossy Source Coding Interpretation of Wyner's Common Information · IEEE Trans. Inf. Theory 2016
Information theory › information measures
operational interpretation
0.212016
A Lossy Source Coding Interpretation of Wyner's Common Information · IEEE Trans. Inf. Theory 2016
Coding theory › source coding
rate-distortion theory
0.212016
A Lossy Source Coding Interpretation of Wyner's Common Information · IEEE Trans. Inf. Theory 2016
Coding theory
source coding
0.212016
A Lossy Source Coding Interpretation of Wyner's Common Information · IEEE Trans. Inf. Theory 2016
Information theory › channel capacity › capacity region
achievable rate region
0.112011
Interference Channels With Arbitrarily Correlated Sources · IEEE Trans. Inf. Theory 2011
Coding theory › source coding › multiterminal source coding
correlated sources
0.112011
Interference Channels With Arbitrarily Correlated Sources · IEEE Trans. Inf. Theory 2011
Information theory › network information theory
interference channel
0.112011
Interference Channels With Arbitrarily Correlated Sources · IEEE Trans. Inf. Theory 2011
Coding theory
joint source-channel coding
0.112011
Interference Channels With Arbitrarily Correlated Sources · IEEE Trans. Inf. Theory 2011
Information theory › network information theory › interference channel
deterministic interference channel
0.012011
Interference Channels With Arbitrarily Correlated Sources · IEEE Trans. Inf. Theory 2011

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

rate-distortion theory · 0.2han-kobayashi coding scheme · 0.1correlation structure analysis · 0.1
YearPublicationVenuePosition
2016 A Lossy Source Coding Interpretation of Wyner's Common Information
abstract
Wyner's common information was originally defined for a pair of dependent discrete random variables. Its significance is largely reflected in, and also confined to, several existing interpretations in various source coding problems. This paper attempts to expand its practical significance by providing a new operational interpretation. In the context of the Gray-Wyner network, it is established that Wyner's common information has a new lossy source coding interpretation. Specifically, it is established that, under suitable conditions, Wyner's common information equals to the smallest common message rate when the total rate is arbitrarily close to the rate distortion function with joint decoding for the Gray-Wyner network. A surprising observation is that such equality holds independent of the values of distortion constraints as long as the distortions are within some distortion region. The new lossy source coding interpretation provides the first meaningful justification for defining Wyner's common information for continuous random variables and the result can also be extended to that of multiple variables. Examples are given for characterizing the rate distortion region for the Gray-Wyner lossy source coding problem and for identifying conditions under which Wyner's common information equals that of the smallest common rate. As a by-product, the explicit expression for the common information between a pair of Gaussian random variables is obtained.
Wei Liu 0017, Biao Chen 0001
IEEE Trans. Inf. Theory2
2011 Interference Channels With Arbitrarily Correlated Sources
abstract
Communicating arbitrarily correlated sources over interference channels is considered in this paper. A sufficient condition is found for lossless transmission of a pair of correlated sources over a discrete memoryless interference channel. With independent sources, the sufficient condition reduces to the Han-Kobayashi achievable rate region for interference channels. For sources with a special correlation structure, the proposed region reduces to the known achievable region for interference channels with common information. Moreover, the proposed coding scheme is optimal for transmitting such set of correlated sources over a class of deterministic interference channels as defined in El Gamal and Costa, 1982.
Wei Liu 0017, Biao Chen 0001
IEEE Trans. Inf. Theory1
2010 Quantization for distributed testing of independence
Minna Chen, Wei Liu 0017, Biao Chen 0001, John D. Matyjas
FUSION2
2010 Communicating correlated sources over interference channels: The lossy case
abstract
In this paper, we consider lossy transmission of two correlated sources over a two-user discrete memoryless interference channel (DMIC). An achievable distortion region is obtained and it is shown that it includes Salehi and Kurtas's result on lossless transmission of correlated sources over a DMIC as a special case. Sending correlated Gaussian sources over a Gaussian interference channel is also studied, and several achievable schemes as well as lower bounds are proposed.
Wei Liu 0017, Biao Chen 0001
ISIT1
2009 Communicating Correlated Gaussian Sources over Gaussian Z Interference Channels
abstract
In this paper, we consider transmission of two correlated Gaussian sources to two receivers through a two-user Gaussian Z interference channel (Z IC). To facilitate our study, we first investigate Gaussian multiple access channels with correlated Gaussian sources and a single distortion constraint at the receiver. Lower bounds on the distortion as well as several achievable schemes are proposed. In particular, a hybrid digital analog transmission scheme is proposed whose achievable region is resolved through coupling it with the quadratic Gaussian CEO problem. These lower bounds and achievable schemes are then applied to the source channel communication over a two-user Gaussian Z IC to derive inner and outer bounds for the distortion region. We conclude this paper by giving a sufficient condition for sending a correlated source over a general Z interference channel.
Wei Liu 0017, Biao Chen 0001
GLOBECOM1