Jin Xu

Syracuse University, Syracuse, New York, United States

Are you Jin Xu?

Claim your profile

Publications (8)7.25 Total impact

  • Source
    Jin Xu, Hao Chen, Biao Chen
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper revisits the interference channels under strong interference and very strong interference, for both discrete memoryless and Gaussian channels. In particular, it is shown that for the classical definitions, while the conditions of strong interference for discrete and Gaussian cases coincide with each other, those of very strong interference are not consistent with each other in terms of mutual information inequalities. Based on this observation, a new class of discrete memoryless interference channels under very strong interference is introduced whose capacity region is characterized. This new class of channels is consistent with the Gaussian interference channel under very strong interference. Moreover, this new class of interference channels is not a subset of any existing classes of discrete memoryless interference channels with known capacity region.
    Global Telecommunications Conference (GLOBECOM 2010), 2010 IEEE; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: Capacity regions and separability results are obtained for several classes of parallel discrete memoryless interference channels with strong interference. In addition, a new class of discrete memoryless interference channels under very strong interference is defined which does not belong to any existing classes.
    Information Theory Workshop (ITW), 2010 IEEE; 02/2010
  • Source
    Jin Xu, Biao Chen
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we study the problem of secure communication over a network in which each link may be noisy or noiseless. A single-source single-sink acyclic planar network is considered, and the communication between the source and the sink is subject to non-cooperating eavesdropping on each link. Sufficient conditions, in terms of communication rates and network parameters, are found for provable secure communication, along with an intuitive and efficient coding scheme. The derived achievable rate equivocation region is tight when specializing to several special cases.
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on; 08/2009
  • Source
    Jin Xu, Biao Chen
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper we study a generalization of Csiszar and Korner's broadcast channel with confidential messages. Specifically, we consider a two-user broadcast channel with one common message and two confidential messages, one for each receiver. We establish outer bounds to the rate equivocation region of this channel. Our proposed outer bounds, together with a recently proposed achievable region, help establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages. Furthermore, specializing to the general broad.cast channel by removing the secrecy constraint, our proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.
    Global Telecommunications Conference, 2008. IEEE GLOBECOM 2008. IEEE; 01/2009
  • Source
    Jin Xu, Biao Chen
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we first review a recently proposed framework for secure communications, namely broadcast channel with confidential and public messages (BCCP). We then generalize the framework to secret key enhanced secure communication and derive the rate-equivocation region for such system. The secret key enhanced framework is further applied to a general multichannel communication systems where any one of the channels is subject to wiretapping. Optimal rate confidentiality tradeoff is obtained for a two channel case and the result generalizes naturally to more than two channels. The developed methodology can be extended to a network setting.
    Military Communications Conference, 2008. MILCOM 2008. IEEE; 12/2008
  • Source
    Jin Xu, Yi Cao, Biao Chen
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study capacity bounds for discrete memoryless broadcast channels with confidential messages. Two private messages as well as a common message are transmitted; the common message is to be decoded by both receivers, while each private message is only for its intended receiver. In addition, each private message is to be kept secret from the unintended receiver where secrecy is measured by equivocation. We propose both inner and outer bounds to the rate equivocation region for broadcast channels with confidential messages. The proposed inner bound generalizes Csisz\'{a}r and K\"{o}rner's rate equivocation region for broadcast channels with a single confidential message, Liu {\em et al}'s achievable rate region for broadcast channels with perfect secrecy, Marton's and Gel'fand and Pinsker's achievable rate region for general broadcast channels. Our proposed outer bounds, together with the inner bound, helps establish the rate equivocation region of several classes of discrete memoryless broadcast channels with confidential messages, including less noisy, deterministic, and semi-deterministic channels. Furthermore, specializing to the general broadcast channel by removing the confidentiality constraint, our proposed outer bounds reduce to new capacity outer bounds for the discrete memory broadcast channel.
    IEEE Transactions on Information Theory 06/2008; · 2.62 Impact Factor
  • Jin Xu, Biao Chen
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider in this paper a variation of Csiszar and Korner's model of broadcast channels with confidential messages. The transmitter sends both a confidential message and a non-confidential message (herein termed as public message) to receiver 1. While receiver 2 should be kept ignorant from the confidential message, we do not impose the requirement that the public message needs to be perfectly recovered by receiver 2. This more liberal treatment of the non-confidential message is perhaps a more reasonable model than Csiszar and Korner's model where the non-confidential message is required to be decoded by both receivers. Measuring ignorance by equivocation rate Re, a single-letter characterization is given of the achievable triples (R<sub>1</sub>, R<sub>e</sub>, R<sub>p</sub>) where R<sub>1</sub> and R<sub>p</sub> are respectively the confidential and public message rates.
    Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on; 04/2008
  • Source
    Jin Xu, Biao Chen, B. Himed
    [Show abstract] [Hide abstract]
    ABSTRACT: We consider in this paper a likelihood principle based approach for the range dependent problem in space time adaptive processing. The proposed generalized likelihood ratio test (GLRT) addresses the range dependent issue by directly applying the likelihood principle to the range dependent signal model. Using the knowledge of platform geometry, we develop maximum likelihood estimators that facilitate the GLRT. This differs from existing methods that rely on data transformations in dealing with the range dependence issue. Numerical examples show that the new GLRT approach exhibits significant performance gain over existing approaches.
    Acoustics, Speech and Signal Processing, 2007. ICASSP 2007. IEEE International Conference on; 05/2007 · 4.63 Impact Factor