Results 1 to 10 of about 342,890 (187)
On the Achievable Rate Region of the K-Receiver Broadcast Channels via Exhaustive Message Splitting [PDF]
Entropy, 2021 This paper focuses on K-receiver discrete-time memoryless broadcast channels (DM-BCs) with private messages, where the transmitter wishes to convey K private messages to K receivers.
Rui Tang, Songjie Xie, Youlong Wu
doaj +2 more sources
Achievable Rate Region under Linear Beamforming for Dual-Hop Multiple-Access Relay Network [PDF]
Entropy, 2018 Consider a network consisting of two independent single-antenna sources, a single-antenna destination and a helping multiple-antenna relay. This network is called a dual-hop multiple access relay network (MARN).
Guiguo Feng, Wangmei Guo, Binyue Liu
doaj +2 more sources
An Achievable Rate-Distortion Region for the Multiple Descriptions Problem [PDF]
2014 IEEE International Symposium on Information Theory, 2014 A multiple-descriptions (MD) coding strategy is proposed and an inner bound to the achievable rate-distortion region is derived. The scheme utilizes linear codes.
Pradhan, Sandeep, Shirani, Farhad
core +2 more sources
An Achievable Rate Region for the Broadcast Channel with Feedback [PDF]
IEEE Transactions on Information Theory, 2013 A single-letter achievable rate region is proposed for the two-receiver discrete memoryless broadcast channel with generalized feedback. The coding strategy involves block-Markov superposition coding, using Marton's coding scheme for the broadcast ...
Pradhan, S. Sandeep +1 more
core +2 more sources
An Achievable Rate Region for Three-Pair Interference Channels with Noise [PDF]
2012 IEEE International Symposium on Information Theory Proceedings, 2012 An achievable rate region for certain noisy three-user-pair interference channels is proposed. The channel class under consideration generalizes the three-pair deterministic interference channel (3-DIC) in the same way as the Telatar-Tse noisy two-pair ...
Bandemer, Bernd
core +2 more sources
On Achievable Rate Region of Multiple Coordinated Multiple Access Channels [PDF]
2011 IEEE 73rd Vehicular Technology Conference (VTC Spring), 2011 Coordination between two or more multiple access channel (MAC) receivers can enlarge the achievable rate region of the whole system. This paper focuses on coordination by sharing the codebooks of the users between the receivers of MACs.
Heliot, Fabién +2 more
core +4 more sources
Multi-Function Computation over a Directed Acyclic Network [PDF]
EntropyThe problem of multi-function computation over a directed acyclic network is investigated in this paper. In such a network, a sink node is required to compute with zero error multiple vector-linear functions, where each vector-linear function has ...
Xiufang Sun +3 more
doaj +2 more sources
Critical Points in the Noiseberg Achievable Region of the Gaussian Z-Interference Channel [PDF]
EntropyThe Gaussian signaling strategy with power control for the Gaussian Z-interference channel with weak interference is reviewed in this paper. In particular, we study the various communication strategies that may arise at various points of the capacity ...
Max H. M. Costa, Chandra Nair, David Ng
doaj +2 more sources
Achievable rate regions for network coding [PDF]
2012 Information Theory and Applications Workshop, 2012 Determining the achievable rate region for networks using routing, linear coding, or non-linear coding is thought to be a difficult task in general, and few are known. We describe the achievable rate regions for four interesting networks (completely for three and partially for the fourth).
Dougherty, Randall +2 more
openaire +2 more sources
Achievable rate regions for Bluetooth piconets in fading channels [PDF]
2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514), 2005 We investigate the stability of a Bluetooth piconet operating in fading (Rice, Rayleigh or Nakagami) channels. By taking into account many protocol details, such as modulation scheme and packet formats, we provide an analytical characterization of the achievable rate regions, which, for a network of N nodes, turns out to be the interior of a convex ...
D. MIORANDI, ZANELLA, ANDREA
openaire +2 more sources