default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXue-Bin Liang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2008
[j19]Xue-Bin Liang:
An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input- Finite-Output Discrete Memoryless Channels. IEEE Trans. Inf. Theory 54(3): 1003-1023 (2008)- [j18]Xue-Bin Liang:
Correction to "An Algebraic, Analytic, and Algorithmic Investigation on the Capacity and Capacity-Achieving Input Probability Distributions of Finite-Input-Finite-Output Discrete Memoryless Channels". IEEE Trans. Inf. Theory 54(9): 4395 (2008) - 2006
- [j17]Xue-Bin Liang:
Matrix games in the multicast networks: maximum information flows with network switching. IEEE Trans. Inf. Theory 52(6): 2433-2466 (2006) - 2005
- [j16]Xue-Bin Liang:
A complex orthogonal space-time block code for 8 transmit antennas. IEEE Commun. Lett. 9(2): 115-117 (2005) - [j15]Xue-Bin Liang, Xiang-Gen Xia:
Fast differential unitary space-time demodulation via square orthogonal designs. IEEE Trans. Wirel. Commun. 4(4): 1331-1336 (2005) - 2003
- [j14]Xue-Bin Liang:
A high-rate orthogonal space-time block code. IEEE Commun. Lett. 7(5): 222-223 (2003) - [j13]Xue-Bin Liang:
Orthogonal designs with maximal rates. IEEE Trans. Inf. Theory 49(10): 2468-2503 (2003) - [j12]Xue-Bin Liang, Xiang-Gen Xia:
On the nonexistence of rate-one generalized complex orthogonal designs. IEEE Trans. Inf. Theory 49(11): 2984-2988 (2003) - 2002
- [j11]Xue-Bin Liang, Xiang-Gen Xia:
Unitary signal constellations for differential space--Time modulation with two transmit antennas: Parametric codes, optimal designs, and bounds. IEEE Trans. Inf. Theory 48(8): 2291-2322 (2002) - [j10]Xue-Bin Liang:
Effect of transmission delay on the rate of convergence of a class of nonlinear contractive dynamical systems. IEEE Trans. Neural Networks 13(1): 244-248 (2002) - [j9]Xue-Bin Liang:
On the analysis of a recurrent neural network for solving nonlinear monotone variational inequality problems. IEEE Trans. Neural Networks 13(2): 481-486 (2002) - 2001
- [j8]Xue-Bin Liang, Jennie Si
:
Global exponential stability of neural networks with globally Lipschitz continuous activations and its application to linear variational inequality problem. IEEE Trans. Neural Networks 12(2): 349-359 (2001) - [j7]Xue-Bin Liang:
A complete proof of global exponential convergence of a neural network for quadratic optimization with bound constraints. IEEE Trans. Neural Networks 12(3): 636-639 (2001) - [j6]Xue-Bin Liang:
A recurrent neural network for nonlinear continuously differentiable optimization over a compact convex subset. IEEE Trans. Neural Networks 12(6): 1487-1490 (2001) - [j5]Xue-Bin Liang:
Qualitative analysis of a recurrent neural network for nonlinear continuously differentiable convex minimization over a nonempty closed convex subset. IEEE Trans. Neural Networks 12(6): 1521-1525 (2001) - 2000
- [j4]Xue-Bin Liang:
Equivalence between local exponential stability of the unique equilibrium point and global stability for Hopfield-type neural networks with two neurons. IEEE Trans. Neural Networks Learn. Syst. 11(5): 1194-1196 (2000) - [j3]Xue-Bin Liang, Jun Wang:
A recurrent neural network for nonlinear optimization with a continuously differentiable objective function and bound constraints. IEEE Trans. Neural Networks Learn. Syst. 11(6): 1251-1262 (2000) - [j2]Xue-Bin Liang:
A comment on "On equilibria, stability, and instability of Hopfield neural networks" [and reply]. IEEE Trans. Neural Networks Learn. Syst. 11(6): 1506-1507 (2000) - 1997
- [j1]Xue-Bin Liang, Li-De Wu:
On an open problem related to the strict local minima of multilinear objective functions. IEEE Trans. Autom. Control. 42(11): 1564-1566 (1997)
Conference and Workshop Papers
- 2011
- [c5]Xue-Bin Liang:
A note on Fanos inequality. CISS 2011: 1-3 - 2010
- [c4]Xue-Bin Liang:
A fast algorithm for computing the capacity of discrete memoryless channels. CISS 2010: 1-6 - 2006
- [c3]Xue-Bin Liang:
A New Iterative Algorithm for Calculating the Capacity of Discrete Memoryless Channels. GLOBECOM 2006 - [c2]Xue-Bin Liang:
On the Switching Gap of Ahlswede-Cai-Li-Yeung's Single-Source Multicast Network. ISIT 2006: 1344-1348 - 2004
- [c1]Xue-Bin Liang:
On a conjecture of Majani and Rumsey. ISIT 2004: 60
Informal and Other Publications
- 2024
- [i1]Xue-Bin Liang:
The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q. CoRR abs/2403.08727 (2024)
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-04-24 23:05 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:
