相关论文: On Capacity Computation for the Two-User Binary Mu…

This paper presents novel numerical approaches to finding the secrecy capacity of the multiple-input multiple-output (MIMO) wiretap channel subject to multiple linear transmit covariance constraints, including sum power constraint, per…

This paper addresses the problem of computing the achievable rates for two (and three) users sharing a same frequency band without coordination and thus interfering with each other. It is thus primarily related to the field of cognitive…

The everlasting bandwidth limitations in wireless communication networks has directed the researchers' thrust toward analyzing the prospect of overloaded Code Division Multiple Access (CDMA). In this paper, we have proposed a Genetic…

In this paper, we consider the channel assignment problem for cognitive radio networks with hardware-constrained secondary users (SUs). In particular, we assume that SUs exploit spectrum holes on a set of channels where each SU can use at…

The quantization of the output of a binary-input discrete memoryless channel to a smaller number of levels is considered. An algorithm which finds an optimal quantizer, in the sense of maximizing mutual information between the channel input…

The capacity region of the 2-user multi-input multi-output (MIMO) Gaussian interference channel (IC) is characterized to within a constant gap that is independent of the channel matrices for the general case of the MIMO IC with an arbitrary…

We consider a multiple-input multiple-output (MIMO) interference channel (IC), where a single data stream per user is transmitted and each receiver treats interference as noise. The paper focuses on the open problem of computing the…

Consider the problem of a Multiple-Input Multiple-Output (MIMO) Multiple-Access Channel (MAC) at the limit of large number of users. Clearly, in practical scenarios, only a small subset of the users can be scheduled to utilize the channel…

This paper addresses the transmission network expansion planning problem considering storage units under uncertain demand and generation capacity. A two-stage adaptive robust optimization framework is adopted whereby short- and long-term…

Network function computation is an active topic in network coding, with much recent progress for linear (over a finite field) computations over broadcast (LCBC) and multiple access (LCMAC) channels. Over a quantum multiple access channel…

We study the half-duplex multiple-relay channel (HD-MRC) where every node can either transmit or listen but cannot do both at the same time. We obtain a capacity upper bound based on a max-flow min-cut argument and achievable transmission…

Capacity formulas and random-coding exponents are derived for a generalized family of Gel'fand-Pinsker coding problems. These exponents yield asymptotic upper bounds on the achievable log probability of error. In our model, information is…

In this paper, we study the multiple-antenna wireless communication networks, where a large number of devices simultaneously communicate with an access point. The capacity region of multiple-input multiple-output massive multiple access…

We propose a method to increase the capacity achieved by uniform prior in discrete memoryless channels (DMC) with high input cardinality. It consists in appropriately reducing the input set. Different design criteria of the input subset are…

In a two-user channel, completion time refers to the number of channel uses spent by each user to transmit a bit pool with some given size. In this paper, the information-theoretic formulation of completion time is based on the concept of…

This paper studies the capacity of a class of discrete memoryless interference channels where interference is defined analogous to that of Gaussian interference channel with one-sided weak interference. The sum-rate capacity of this class…

This work introduces the particle-intensity channel (PIC) as a model for molecular communication systems and characterizes the properties of the optimal input distribution and the capacity limits for this system. In the PIC, the transmitter…

In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Costa entropy power inequality (EPI) along with an…

We consider a search algorithm for the output distribution that achieves the channel capacity of a discrete memoryless channel. We will propose an algorithm by iterated projections of an output distribution onto affine subspaces in the set…

We derive a lower and upper bound on the reliability function of discrete memoryless multiple-access channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the…