4 problems

Consider the described slotted multiple-access system with $N$ users, where each user transmits a message $K+1$ times, and let $\rho=0$ denote the noiseless channel, so that a soli…

Consider a slotted multiple-access system with an infinite-user limiting case and finite systems containing $N$ users. Let $K$ denote the number of retransmissions, and suppose tha…

Let $h\in\mathcal H$ and let $\varepsilon_h\in\mathcal E_h$. The class-3 algorithm $A_3(C,h,1-\varepsilon_h)$ is obtained from the class-2 algorithm by using transmission probabili…

Let $0<\lambda_0<e^{-1}$ be any number. Choose $C>0$ and $\beta_2\in(0,1)$. For $h\in\mathcal H$, let $A_2(C,h,\beta)$ be the class-2 algorithm defined by transmission probabilitie…