Guangyue Han

Shlomo Shamai

IEEE Trans. Inf. Theory, September, 2024

MacWilliams Extension Property With Respect to Weighted Poset Metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, February, 2024

Rényi Entropy Rate of Stationary Ergodic Processes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, January, 2024

r-Minimal Codes with Respect to Rank Metric.

[BibT_eX]

[DOI]

CoRR, 2024

The Langberg-Médard Multiple Unicast Conjecture for Networks with Collapsed Backbone.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Reflexivity of Partitions Induced by Weighted Poset Metric and Combinatorial Metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, October, 2023

An optimization approach to the Langberg-Médard multiple unicast conjecture.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

Feedback Capacity of OU-Colored AWGN Channels.

[BibT_eX]

[DOI]

Jun Su

Shlomo Shamai Shitz

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Fourier-Reflexive Partitions Induced by Poset Metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

A Deterministic Algorithm for the Capacity of Finite-State Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

On Sampling Continuous-Time AWGN Channels.

[BibT_eX]

[DOI]

Shlomo Shamai

IEEE Trans. Inf. Theory, 2022

The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

A Galois Connection Approach to Wei-Type Duality Theorems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Renyi Entropy Rate of Stationary Ergodic Processes.

[BibT_eX]

[DOI]

CoRR, 2022

Fourier-Reflexive Partitions and Group of Linear Isometries with Respect to Weighted Poset Metric.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Minimal Length of Nontrivial Solutions of the Isometry Equation and MacWilliams Extension Property with Respect to Weighted Poset Metric.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

2020

On Sampling Continuous-Time Gaussian Channels.

[BibT_eX]

[DOI]

Shlomo Shamai

CoRR, 2020

The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Feedback Capacity of Stationary Gaussian Channels Further Examined.

[BibT_eX]

[DOI]

Tao Liu

IEEE Trans. Inf. Theory, 2019

On Mergings in Acyclic Directed Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

On Continuous-Time Gaussian Channels.

[BibT_eX]

[DOI]

Xianming Liu

Entropy, 2019

Spectral Ratio for Positive Matrices.

[BibT_eX]

[DOI]

Wendi Han

CoRR, 2019

A Deterministic Algorithm for the Capacity of Finite-State Channels.

[BibT_eX]

[DOI]

Chengyu Wu

Proceedings of the IEEE International Symposium on Information Theory, 2019

An Elementary Proof of a Classical Information-Theoretic Formula.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Capacity of the Flash Memory Channel with Inter-cell Interference.

[BibT_eX]

[DOI]

Paul H. Siegel

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

On Sequential Locally Repairable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Asymptotics of Input-Constrained Erasure Channel Capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Counterexample to the Vector Generalization of Costa's Entropy Power Inequality, and Partial Resolution.

[BibT_eX]

[DOI]

Thomas A. Courtade

Yaochen Wu

IEEE Trans. Inf. Theory, 2018

On the Langberg-Médard k-Unicast Conjecture with $k=3, 4$.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Capacity of Multilevel NAND Flash Memory Channels.

[BibT_eX]

[DOI]

Aleksandar Kavcic

IEEE Trans. Inf. Theory, 2017

On the Langberg-Médard multiple unicast conjecture.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

A Counterexample to the Vector Generalization of Costa's EPI, and Partial Resolution.

[BibT_eX]

[DOI]

Thomas A. Courtade

Yaochen Wu

CoRR, 2017

Network encoding complexity: Exact values, bounds, and inequalities.

[BibT_eX]

[DOI]

Weiping Shang

Adv. Math. Commun., 2017

Rényi entropy rate of hidden Markov processes.

[BibT_eX]

[DOI]

Chengyu Wu

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

The ARMA(k) Gaussian feedback capacity.

[BibT_eX]

[DOI]

Tao Liu

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Extensions of the I-MMSE Relationship to Gaussian Channels With Feedback and Memory.

[BibT_eX]

[DOI]

Jian Song

IEEE Trans. Inf. Theory, 2016

On the criteria for designing complex orthogonal space-time block codes.

[BibT_eX]

[DOI]

Xiaodong Liu

Sci. China Inf. Sci., 2016

ARMA(1) Gaussian feedback capacity revisited.

[BibT_eX]

[DOI]

Tao Liu

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Coding advantage in communications among peers.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

Analyticity of Entropy Rate of Hidden Markov Chains With Continuous Alphabet.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

A Randomized Algorithm for the Capacity of Finite-State Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

The minimum number of hubs in networks.

[BibT_eX]

[DOI]

J. Comb. Optim., 2015

On network coding advantage for multiple unicast networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

On the solvability of three-pair networks with common bottleneck links.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Information Theory Workshop, 2014

Recent results in continuous-time network information theory.

[BibT_eX]

[DOI]

Xianming Liu

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Input-constrained erasure channels: Mutual information and capacity.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Extensions of the I-MMSE relation.

[BibT_eX]

[DOI]

Jian Song

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Limit Theorems in Hidden Markov Models.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Concavity of mutual information rate of finite-state channels.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A randomized approach to the capacity of finite-state channels.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Concavity of the Mutual Information Rate for Input-Restricted Memoryless Channels at High SNR.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Analyticity of Entropy Rate of Continuous-State Hidden Markov Chains

[BibT_eX]

[DOI]

CoRR, 2012

A graph theoretical approach to network encoding complexity.

[BibT_eX]

[DOI]

Weiping Shang

Proceedings of the International Symposium on Information Theory and its Applications, 2012

2011

A Heuristic Algorithm for the Inner-City Multi-Drop: Container Loading Problem.

[BibT_eX]

[DOI]

Int. J. Oper. Res. Inf. Syst., 2011

Limit theorems for the sample entropy of hidden Markov chains.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Bounds and exact values in network encoding complexity with two sinks.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Asymptotics of entropy rate in special families of hidden Markov chains.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Entropy rate of continuous-state hidden Markov chains.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

2009

A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes

[BibT_eX]

[DOI]

Yuval Peres

CoRR, 2009

Menger's paths with minimum mergings.

[BibT_eX]

[DOI]

Proceedings of the 2009 IEEE Information Theory Workshop, 2009

Concavity of mutual information rate for input-restricted finite-state memoryless channels at high SNR.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

2008

Asymptotics of Input-Constrained Binary Symmetric Channel Capacity

[BibT_eX]

[DOI]

CoRR, 2008

Asymptotics of entropy rate of hidden Markov chains at weak Black Holes.

[BibT_eX]

[DOI]

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007

Derivatives of Entropy Rate in Special Families of Hidden Markov Chains.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Asymptotics of Noisy Constrained Channel Capacity.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Unitary Space-Time Constellation Analysis: An Upper Bound for the Diversity.

[BibT_eX]

[DOI]

Joachim Rosenthal

IEEE Trans. Inf. Theory, 2006

Geometrical and Numerical Design of Structured Unitary Space-Time Constellations.

[BibT_eX]

[DOI]

Joachim Rosenthal

IEEE Trans. Inf. Theory, 2006

Analyticity of Entropy Rate of Hidden Markov Chains.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Analyticity of Entropy Rate in Families of Hidden Markov Chains (II).

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Generalized PSK in space-time coding.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2005

Analyticity of entropy rate in families of hidden markov chains.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Upper bound analysis of diversity for unitary space time constellations.

[BibT_eX]

[DOI]