Skip to Main Content
In this paper we address the mutual interference problems that arise as a result of many independent terminals simultaneously accessing a common channel. "Random code" bounds are used to show the existence of large signal sets for which any one signal can be reliably detected by matched filters despite the mutual interference. Two types of signal sets are considered: sets with a unique signature for every terminal and sets drawn from a small collection of distinct waveforms. The latter sets permit reductions in receiver complexity.