Xue-Bin Liang

According to our database1, Xue-Bin Liang authored at least 25 papers between 1997 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The q-ary Gilbert-Varshamov bound can be improved for all but finitely many positive integers q.
CoRR, 2024

2011
A note on Fanos inequality.
Proceedings of the 45st Annual Conference on Information Sciences and Systems, 2011

2010
A fast algorithm for computing the capacity of discrete memoryless channels.
Proceedings of the 44th Annual Conference on Information Sciences and Systems, 2010

2008
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, 2008

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, 2008

2006
Matrix games in the multicast networks: maximum information flows with network switching.
IEEE Trans. Inf. Theory, 2006

On the Switching Gap of Ahlswede-Cai-Li-Yeung's Single-Source Multicast Network.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

A New Iterative Algorithm for Calculating the Capacity of Discrete Memoryless Channels.
Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

2005
Fast differential unitary space-time demodulation via square orthogonal designs.
IEEE Trans. Wirel. Commun., 2005

A complex orthogonal space-time block code for 8 transmit antennas.
IEEE Commun. Lett., 2005

2004
On a conjecture of Majani and Rumsey.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
On the nonexistence of rate-one generalized complex orthogonal designs.
IEEE Trans. Inf. Theory, 2003

Orthogonal designs with maximal rates.
IEEE Trans. Inf. Theory, 2003

A high-rate orthogonal space-time block code.
IEEE Commun. Lett., 2003

2002
On the analysis of a recurrent neural network for solving nonlinear monotone variational inequality problems.
IEEE Trans. Neural Networks, 2002

Effect of transmission delay on the rate of convergence of a class of nonlinear contractive dynamical systems.
IEEE Trans. Neural Networks, 2002

Unitary signal constellations for differential space--Time modulation with two transmit antennas: Parametric codes, optimal designs, and bounds.
IEEE Trans. Inf. Theory, 2002

2001
Global exponential stability of neural networks with globally Lipschitz continuous activations and its application to linear variational inequality problem.
IEEE Trans. Neural Networks, 2001

Qualitative analysis of a recurrent neural network for nonlinear continuously differentiable convex minimization over a nonempty closed convex subset.
IEEE Trans. Neural Networks, 2001

A recurrent neural network for nonlinear continuously differentiable optimization over a compact convex subset.
IEEE Trans. Neural Networks, 2001

A complete proof of global exponential convergence of a neural network for quadratic optimization with bound constraints.
IEEE Trans. Neural Networks, 2001

2000
A recurrent neural network for nonlinear optimization with a continuously differentiable objective function and bound constraints.
IEEE Trans. Neural Networks Learn. Syst., 2000

A comment on "On equilibria, stability, and instability of Hopfield neural networks" [and reply].
IEEE Trans. Neural Networks Learn. Syst., 2000

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., 2000

1997
On an open problem related to the strict local minima of multilinear objective functions.
IEEE Trans. Autom. Control., 1997


  Loading...