Multiple‐Access Channels

TL;DR: In this paper, a thorough analysis of tree-algorithms with multi-packet reception (MPR) and successive interference cancellation (SIC) is performed, where the basic performance parameters are the expected length of the collision resolution interval and the normalized throughput, conditioned on the number of contending users.

TL;DR: In this article, the exponential error bounds achievable by universal coding and decoding for frame-asynchronous discrete memoryless multiple access channels with two senders were derived via the method of subtypes.

TL;DR: In this article , the capacity region of a classical-quantum compound broadcast channel with degraded message sets was established using generalized packing lemmas for the type method, and a universal classicalquantum superposition code was derived.

TL;DR: Simulation results demonstrate that the proposed low complexity iterative receivers structure for interference suppression and decoding offers significant performance gain over the traditional noniterative receiver structure.

TL;DR: This correspondence describes the construction of complex codes of the form exp i \alpha_k whose discrete circular autocorrelations are zero for all nonzero lags.

TL;DR: This paper presents a survey of recent results and provides several new results on the periodic and aperiodic crosscorrelation functions for pairs of m-sequences and for Pair of related (but not maximal-length) binary shift register sequences.

TL;DR: This work focuses on the multiaccess fading channel with Gaussian noise, and defines two notions of capacity depending on whether the traffic is delay-sensitive or not, and characterize the throughput capacity region which contains the long-term achievable rates through the time-varying channel.