1 problem

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…