We study and compare the Shannon capacity region and the stable throughput region for a random access system in which source nodes multicast their messages to multiple destination nodes. Under an erasure channel model which accounts for interference and allows for multipacket reception, we first characterize the Shannon capacity region. We then consider a queueing-theoretic formulation and char...

Körner and Marton established the capacity region for the 2-receiver broadcast channel with degraded message sets. Recent results and conjectures suggest that a straightforward extension of the Körner-Marton region to more than 2 receivers is optimal. This paper shows that this is not the case. We establish the capacity region for a class of 3-receiver broadcast channels with 2-degraded message...

the purpose of this study was to determ the degree, level and capacity indices of agricultural mechanization in sarab region (n: 37º45', e: 47º30') in eastern azarbayjan province, comprising about 65,164 hectares of farming land. the number of tractors, types of machines, and degree, level, and capacity of mechanization were calculated as the method of study. data showed that the average level ...

The routing capacity region of networks with multiple unicast sessions can be characterized using Farkas lemma as an infinite set of linear inequalities. In this paper this result is sharpened by exploiting properties of the solution satisfied by each ratetuple on the boundary of the capacity region, and a finite description of the routing capacity region which depends on network parameters is ...

In this paper, we derive a capacity inner bound for a synchronous Gaussian Z channel with intersymbol interference (ISI) under input power constraints. This is done by converting the original channel model into an n-block memoryless circular Gaussian Z channel (n-CGZC) and successively decomposing the n-block memoryless channel into a series of independent parallel channels in the frequency dom...

Abstract—In this paper we consider the identification (ID) via multiple access channels (MACs). In the general MAC the ID capacity region includes the ordinary transmission (TR) capacity region. In this paper we discuss the converse coding theorem. We estimate two types of error probabilities of identification for rates outside capacity region, deriving some function which serves as a lower bou...

The capacity of the multiple-access channel with any distribution of messages among the transmitting nodes was determined by Han in 1979 and the expression of the capacity region contains a number of rate bounds and that grows exponentially with the number of messages. We derive a more compact expression for the capacity region of this channel in which the number of rate bounds depends on the d...

Previous works established the capacity region for some special cases of discrete memoryless degraded cognitive interference channel (CIC) with unidirectional destination cooperation (UDC). In this letter, we characterize the capacity region of the general discrete memoryless degraded CIC-UDC. The obtained results imply that the capacity region is achieved by the Gel’fand-Pinsker coding at the ...

The capacity region of m-user non-white Gaussian multiple access channel without feedback was exactly obtained. But it is not yet obtained in the feedback case without the upper bound of total capacity. We give the outer bound of capacity region in muser non-white Gaussian multiple access channel with noiseless and nodelayed feedback in general. Finally we remark that there are three types of o...

The capacity region of the multiple antenna (transmit and receive) broadcast channel is considered. We propose an outer bound to the capacity region by converting this nondegraded broadcast channel into a degraded one with users privy to the signals of users ordered below them. We extend our proof techniques in the characterization of the sum capacity of the multiple antenna broadcast channel t...