Results 271 to 280 of about 700,115 (306)

Coding for a multiple-access channel

IEEE Transactions on Information Theory, 1976
Summary: In this paper, coding for a multiple-access discrete memoryless channel is investigated. Some bounds on the rate pairs of uniquely decodable code pairs are derived. Coding procedures based on the Reed-Muller codes and their cosets are described for the noiseless case and for correction of single errors.
Tadao Kasami, Shu Lin 0001
openaire   +2 more sources

Adversarial queuing on the multiple-access channel

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, 2006
We study deterministic broadcasting on multiple access channels when packets are injected continuously. The quality of service is considered in the framework of adversarial queuing. An adversary is determined by injection rate and burstiness, the latter denoting the number of packets that can be injected simultaneously in a round.
Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki   +2 more
openaire   +1 more source

Compositional Restricted Multiple Access Channel

Problems of Information Transmission, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E. E. Egorova, V. S. Potapova
openaire   +1 more source

Access Channel Performance in CDMA2000

IEEE International Conference on Computer Systems and Applications, 2006., 2006
In this paper, performance evaluation for the access channel in third generation CDMA 2000 mobile radio systems is presented. Probability of detection, probability of false alarm, and mean acquisition time are presented in a typical frequency selective Rayleigh fading mobile radio channel.
openaire   +1 more source

Theory Of Markovian Access to Collision Channels

IEEE Transactions on Communications, 1987
Summary: A unified, analytical framework for the analysis of Markovian access control protocols in collision channels with a finite number of buffered users is presented. The theory developed is based on: 1) an appropriate state-space modeling of a network, 2) the averaging theory for the slow- in-the-average Markov walks used for the local analysis ...
LIM, JT Lim, Jong-Tae, MEERKOV, SM
openaire   +2 more sources

On multiple access channels with feedback

IEEE Trans. Inf. Theory, 1984
Summary: For the binary erasure multiple access channel, \textit{E. C. van der Meulen} [ibid. IT-23, 1-37 (1977; Zbl 0355.94035)] showed in his survey paper that the symmetrical rate pair (0.79113, 0.79113) is achievable in the case of feedback. Here we prove that this rate point is on the boundary of the feedback capacity region. Subsequently we apply
openaire   +1 more source

Decoding for multiple-access channels

2005
We discuss some results in coding and decoding for multiple-access channels. A new approach to choosing codes and users' energies for that channel is described. For the case when a bit error probability and a decoding complexity are fixed we construct a region of achievable code rates.
openaire   +1 more source

Access channels

Nature Reviews Neuroscience, 2022
openaire   +2 more sources

Mismatched decoding and the multiple-access channel

IEEE Transactions on Information Theory, 1996
An achievable region is derived for the multiple-access channel under decoding mismatch conditions. It is shown that achievable rates higher than the random coding capacity of the single-user mismatched channel can sometimes be demonstrated by treating the single-user channel as a multiple-access channel. Refining these ideas we derive a lower bound on
openaire   +1 more source

Channel Access Control

2002
In this chapter the performance of various channel access control policies is evaluated in terms of call level QoS parameters such as call blocking probability and call dropping probability, using multi-dimensional Markov chain analysis. First some basic conventional policies are discussed to lay proper ground work, and thereafter the two priority ...
Tejinder S. Randhawa, Stephen Hardy
openaire   +1 more source