default search action
Guangyue Han
Person information
- affiliation: University of Hong Kong, Department of Mathematics, Hong Kong
- affiliation (2004 - 2007): University of British Columbia, Department of Mathematics, Vancouver, Canada
- affiliation (PhD 2004): University of Notre Dame, Department of Mathematics, IN, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j33]Chengyu Wu
, Yonglong Li, Easton Li Xu
Rényi Entropy Rate of Stationary Ergodic Processes. IEEE Trans. Inf. Theory 70(1): 1-15 (2024) - [j32]Yang Xu
MacWilliams Extension Property With Respect to Weighted Poset Metric. IEEE Trans. Inf. Theory 70(2): 995-1007 (2024) - [j31]Jun Su
Feedback Capacity of the Continuous-Time ARMA(1,1) Gaussian Channel. IEEE Trans. Inf. Theory 70(9): 6171-6188 (2024) - [c33]Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture for Networks with Collapsed Backbone. ISIT 2024: 1309-1314 - [i32]Yang Xu, Haibin Kan, Guangyue Han:
r-Minimal Codes with Respect to Rank Metric. CoRR abs/2408.15592 (2024) - 2023
- [j30]Kai Cai, Guangyue Han:
An optimization approach to the Langberg-Médard multiple unicast conjecture. Adv. Math. Commun. 17(2): 431-445 (2023) - [j29]Yang Xu
Reflexivity of Partitions Induced by Weighted Poset Metric and Combinatorial Metric. IEEE Trans. Inf. Theory 69(10): 6485-6499 (2023) - [c32]Jun Su, Guangyue Han, Shlomo Shamai Shitz:
Feedback Capacity of OU-Colored AWGN Channels. ISIT 2023: 945-950 - [i31]Jun Su, Guangyue Han, Shlomo Shamai:
Feedback Capacity of OU-Colored AWGN Channels. CoRR abs/2302.13073 (2023) - 2022
- [j28]Guangyue Han
On Sampling Continuous-Time AWGN Channels. IEEE Trans. Inf. Theory 68(2): 782-794 (2022) - [j27]Chengyu Wu
A Deterministic Algorithm for the Capacity of Finite-State Channels. IEEE Trans. Inf. Theory 68(3): 1465-1479 (2022) - [j26]Yang Xu
Fourier-Reflexive Partitions Induced by Poset Metric. IEEE Trans. Inf. Theory 68(4): 2319-2330 (2022) - [j25]Kai Cai
The Langberg-Médard Multiple Unicast Conjecture for 3-Pair Networks. IEEE Trans. Inf. Theory 68(6): 3879-3895 (2022) - [j24]Yang Xu
A Galois Connection Approach to Wei-Type Duality Theorems. IEEE Trans. Inf. Theory 68(8): 5133-5144 (2022) - [c31]Yang Xu, Haibin Kan, Guangyue Han:
Minimal Length of Nontrivial Solutions of the Isometry Equation and MacWilliams Extension Property with Respect to Weighted Poset Metric. ISIT 2022: 1969-1974 - [c30]Yang Xu, Haibin Kan, Guangyue Han:
Fourier-Reflexive Partitions and Group of Linear Isometries with Respect to Weighted Poset Metric. ISIT 2022: 1975-1980 - [i30]Yang Xu, Haibin Kan, Guangyue Han:
Fourier-Reflexive Partitions and Group of Linear Isometries with Respect to Weighted Poset Metric. CoRR abs/2201.10828 (2022) - [i29]Yang Xu, Haibin Kan, Guangyue Han:
Minimal Length of Nontrivial Solutions of the Isometry Equation and MacWilliams Extension Property with Respect to Weighted Poset Metric. CoRR abs/2202.01551 (2022) - [i28]Chengyu Wu, Yonglong Li, Li Xu, Guangyue Han:
Renyi Entropy Rate of Stationary Ergodic Processes. CoRR abs/2207.07554 (2022) - 2021
- [c29]Yang Xu, Haibin Kan, Guangyue Han:
Fourier-Reflexive Partitions Induced by Poset Metric. ISIT 2021: 296-301 - [i27]Yang Xu, Haibin Kan, Guangyue Han:
Fourier-Reflexive Partitions Induced by Poset Metric. CoRR abs/2107.10401 (2021) - 2020
- [c28]Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks. ISIT 2020: 1617-1622 - [i26]Kai Cai, Guangyue Han:
The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks. CoRR abs/2001.02017 (2020) - [i25]Guangyue Han, Shlomo Shamai:
On Sampling Continuous-Time Gaussian Channels. CoRR abs/2002.02716 (2020) - [i24]Yang Xu, Haibin Kan, Guangyue Han:
A Galois Connection Approach to Wei-Type Duality Theorems. CoRR abs/2011.13599 (2020)
2010 – 2019
- 2019
- [j23]Xianming Liu
On Continuous-Time Gaussian Channels. Entropy 21(1): 67 (2019) - [j22]Guangyue Han:
On Mergings in Acyclic Directed Graphs. SIAM J. Discret. Math. 33(3): 1482-1502 (2019) - [j21]Tao Liu
Feedback Capacity of Stationary Gaussian Channels Further Examined. IEEE Trans. Inf. Theory 65(4): 2492-2506 (2019) - [c27]Yonglong Li, Guangyue Han, Paul H. Siegel:
On the Capacity of the Flash Memory Channel with Inter-cell Interference. ISIT 2019: 1007-1011 - [c26]Xianming Liu
An Elementary Proof of a Classical Information-Theoretic Formula. ISIT 2019: 1392-1396 - [c25]Chengyu Wu, Guangyue Han, Brian H. Marcus:
A Deterministic Algorithm for the Capacity of Finite-State Channels. ISIT 2019: 1897-1901 - [i23]Chengyu Wu, Guangyue Han, Brian H. Marcus:
A Deterministic Algorithm for the Capacity of Finite-State Channels. CoRR abs/1901.02678 (2019) - [i22]Wendi Han, Guangyue Han:
Spectral Ratio for Positive Matrices. CoRR abs/1906.04875 (2019) - 2018
- [j20]Yonglong Li
Asymptotics of Input-Constrained Erasure Channel Capacity. IEEE Trans. Inf. Theory 64(1): 148-162 (2018) - [j19]Wentu Song, Kai Cai, Chau Yuen, Kui Cai, Guangyue Han:
On Sequential Locally Repairable Codes. IEEE Trans. Inf. Theory 64(5): 3513-3527 (2018) - [j18]Thomas A. Courtade
Counterexample to the Vector Generalization of Costa's Entropy Power Inequality, and Partial Resolution. IEEE Trans. Inf. Theory 64(7): 5453-5454 (2018) - [c24]Kai Cai, Guangyue Han:
On the Langberg-Médard k-Unicast Conjecture with $k=3, 4$. ISIT 2018: 246-250 - [i21]Kai Cai, Guangyue Han:
An Optimization Approach to the Langberg-Médard Multiple Unicast Conjecture. CoRR abs/1806.03408 (2018) - [i20]Xianming Liu, Ronit Bustin, Guangyue Han, Shlomo Shamai:
An Elementary Proof of a Classical Information-Theoretic Formula. CoRR abs/1809.01422 (2018) - 2017
- [j17]Easton Li Xu, Weiping Shang, Guangyue Han:
Network encoding complexity: Exact values, bounds, and inequalities. Adv. Math. Commun. 11(3): 567-594 (2017) - [j16]Kai Cai, Guangyue Han:
On the Langberg-Médard multiple unicast conjecture. J. Comb. Optim. 34(4): 1114-1132 (2017) - [j15]Yonglong Li
Capacity of Multilevel NAND Flash Memory Channels. IEEE Trans. Inf. Theory 63(9): 5934-5953 (2017) - [c23]Tao Liu, Guangyue Han:
The ARMA(k) Gaussian feedback capacity. ISIT 2017: 211-215 - [c22]Chengyu Wu, Easton Li Xu, Guangyue Han:
Rényi entropy rate of hidden Markov processes. ISIT 2017: 2970-2974 - [i19]Tao Liu, Guangyue Han:
The ARMA(k) Gaussian Feedback Capacity. CoRR abs/1702.03059 (2017) - [i18]Xianming Liu, Guangyue Han:
On Continuous-Time Gaussian Channels. CoRR abs/1704.02569 (2017) - [i17]Thomas A. Courtade, Guangyue Han, Yaochen Wu:
A Counterexample to the Vector Generalization of Costa's EPI, and Partial Resolution. CoRR abs/1704.06164 (2017) - 2016
- [j14]Haibin Kan, Xiaodong Liu, Guangyue Han:
On the criteria for designing complex orthogonal space-time block codes. Sci. China Inf. Sci. 59(8): 082303:1-082303:11 (2016) - [j13]Guangyue Han
Extensions of the I-MMSE Relationship to Gaussian Channels With Feedback and Memory. IEEE Trans. Inf. Theory 62(10): 5422-5445 (2016) - [c21]Yonglong Li, Aleksandar Kavcic, Guangyue Han:
On the capacity of multilevel NAND flash memory channels. ISIT 2016: 1869-1873 - [c20]Kai Cai, Guangyue Han:
Coding advantage in communications among peers. ISIT 2016: 2309-2313 - [c19]Guangyue Han, Tao Liu:
ARMA(1) Gaussian feedback capacity revisited. ISITA 2016: 111-115 - [i16]Yonglong Li, Aleksandar Kavcic, Guangyue Han:
On the Capacity of Multilevel NAND Flash Memory Channels. CoRR abs/1601.05677 (2016) - [i15]Yonglong Li, Guangyue Han:
Asymptotics of Input-Constrained Erasure Channel Capacity. CoRR abs/1605.02175 (2016) - 2015
- [j12]Easton Li Xu, Guangyue Han:
The minimum number of hubs in networks. J. Comb. Optim. 30(4): 1196-1218 (2015) - [j11]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate of Hidden Markov Chains With Continuous Alphabet. IEEE Trans. Inf. Theory 61(6): 3013-3028 (2015) - [j10]Guangyue Han:
A Randomized Algorithm for the Capacity of Finite-State Channels. IEEE Trans. Inf. Theory 61(7): 3651-3669 (2015) - [c18]Kai Cai, Guangyue Han:
On network coding advantage for multiple unicast networks. ISIT 2015: 366-370 - [i14]Guangyue Han, Jian Song:
Extensions of the I-MMSE Relation. CoRR abs/1506.07230 (2015) - 2014
- [c17]Guangyue Han, Jian Song
Extensions of the I-MMSE relation. ISIT 2014: 2202-2206 - [c16]Xianming Liu
Recent results in continuous-time network information theory. ISIT 2014: 2421-2425 - [c15]Yonglong Li, Guangyue Han:
Input-constrained erasure channels: Mutual information and capacity. ISIT 2014: 3072-3076 - [c14]Kai Cai, Guangyue Han:
On the solvability of three-pair networks with common bottleneck links. ITW 2014: 546-550 - [i13]Guangyue Han, Jian Song:
Extensions of the I-MMSE Relation. CoRR abs/1401.3527 (2014) - [i12]Xianming Liu, Guangyue Han:
Recent Results in Continuous-Time Network Information Theory. CoRR abs/1401.3529 (2014) - 2013
- [j9]Guangyue Han:
Limit Theorems in Hidden Markov Models. IEEE Trans. Inf. Theory 59(3): 1311-1328 (2013) - [c13]Guangyue Han:
A randomized approach to the capacity of finite-state channels. ISIT 2013: 2109-2113 - [c12]Yonglong Li, Guangyue Han:
Concavity of mutual information rate of finite-state channels. ISIT 2013: 2114-2118 - [i11]Guangyue Han:
A Randomized Approach to the Capacity of Finite-State Channels. CoRR abs/1303.3656 (2013) - 2012
- [j8]Guangyue Han, Brian H. Marcus:
Concavity of the Mutual Information Rate for Input-Restricted Memoryless Channels at High SNR. IEEE Trans. Inf. Theory 58(3): 1534-1548 (2012) - [c11]Easton Li Xu, Weiping Shang, Guangyue Han:
A graph theoretical approach to network encoding complexity. ISITA 2012: 396-400 - [i10]Easton Li Xu, Weiping Shang, Guangyue Han:
A Graph Theoretical Approach to Network Encoding Complexity. CoRR abs/1202.0747 (2012) - [i9]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate of Continuous-State Hidden Markov Chains. CoRR abs/1208.3261 (2012) - 2011
- [j7]Li Pan, Sydney C. K. Chu, Guangyue Han, Joshua Zhexue Huang:
A Heuristic Algorithm for the Inner-City Multi-Drop: Container Loading Problem. Int. J. Oper. Res. Inf. Syst. 2(3): 1-19 (2011) - [c10]Easton Li Xu, Guangyue Han:
Bounds and exact values in network encoding complexity with two sinks. Allerton 2011: 1462-1469 - [c9]Guangyue Han:
Limit theorems for the sample entropy of hidden Markov chains. ISIT 2011: 3009-3013 - [i8]Guangyue Han:
Limit Theorems for the Sample Entropy of Hidden Markov Chains. CoRR abs/1102.0365 (2011) - 2010
- [j6]Guangyue Han, Brian H. Marcus:
Asymptotics of entropy rate in special families of hidden Markov chains. IEEE Trans. Inf. Theory 56(3): 1287-1295 (2010) - [c8]Guangyue Han, Brian H. Marcus:
Entropy rate of continuous-state hidden Markov chains. ISIT 2010: 1468-1472 - [i7]Guangyue Han, Brian H. Marcus:
Concavity of Mutual Information Rate for Input-Restricted Finite-State Memoryless Channels at High SNR. CoRR abs/1007.4604 (2010)
2000 – 2009
- 2009
- [c7]Guangyue Han, Brian H. Marcus:
Concavity of mutual information rate for input-restricted finite-state memoryless channels at high SNR. ISIT 2009: 1654-1658 - [c6]Guangyue Han:
Menger's paths with minimum mergings. ITW 2009: 271-275 - [i6]Guangyue Han, Brian H. Marcus, Yuval Peres:
A note on a complex Hilbert metric with application to domain of analyticity for entropy rate of hidden Markov processes. CoRR abs/0905.2479 (2009) - 2008
- [c5]Guangyue Han, Brian H. Marcus:
Asymptotics of entropy rate of hidden Markov chains at weak Black Holes. ISIT 2008: 2629-2633 - [i5]Guangyue Han, Brian H. Marcus:
Asymptotics of Input-Constrained Binary Symmetric Channel Capacity. CoRR abs/0803.3360 (2008) - [i4]Guangyue Han:
Menger's Paths with Minimum Mergings. CoRR abs/0805.4059 (2008) - [i3]Guangyue Han, Brian H. Marcus:
Asymptotics of Entropy Rate in Special Families of Hidden Markov Chains. CoRR abs/0810.2144 (2008) - 2007
- [j5]Guangyue Han, Brian H. Marcus:
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains. IEEE Trans. Inf. Theory 53(7): 2642-2652 (2007) - [c4]Guangyue Han, Brian H. Marcus:
Asymptotics of Noisy Constrained Channel Capacity. ISIT 2007: 991-995 - 2006
- [j4]Guangyue Han, Joachim Rosenthal
Geometrical and Numerical Design of Structured Unitary Space-Time Constellations. IEEE Trans. Inf. Theory 52(8): 3722-3735 (2006) - [j3]Guangyue Han, Joachim Rosenthal
Unitary Space-Time Constellation Analysis: An Upper Bound for the Diversity. IEEE Trans. Inf. Theory 52(10): 4713-4721 (2006) - [j2]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate of Hidden Markov Chains. IEEE Trans. Inf. Theory 52(12): 5251-5266 (2006) - [c3]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate in Families of Hidden Markov Chains (II). ISIT 2006: 103-107 - [i2]Guangyue Han, Brian H. Marcus:
Derivatives of Entropy Rate in Special Families of Hidden Markov Chains. CoRR abs/cs/0603059 (2006) - 2005
- [j1]Guangyue Han:
Generalized PSK in space-time coding. IEEE Trans. Commun. 53(5): 790-801 (2005) - [c2]Guangyue Han, Brian H. Marcus:
Analyticity of entropy rate in families of hidden markov chains. ISIT 2005: 2193-2197 - [i1]Guangyue Han, Brian H. Marcus:
Analyticity of Entropy Rate of Hidden Markov Chains. CoRR abs/math/0507235 (2005) - 2004
- [c1]Guangyue Han, Joachim Rosenthal:
Upper bound analysis of diversity for unitary space time constellations. ISIT 2004: 157
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-12 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: