Sequências de Protocolo para o Canal de Colisão sem Realimentação

The collision channel without feedback (CCWFB) is a proposed channel model for situations in which a given number of users share the same communication channel for sending bit packets. In the CCWFB each user has a protocol sequence that determines the time intervals in which the user can send his packets. Cyclically permutable (CP) codes provide a natural solution to the construction of protocol sequences for the CCWFB when a fraction of the total number of users are active in a given time interval. In this paper, a theorem is proved on how CP codes can be used as a set of efficient protocol sequences, whether the codes are constant-weight or not. Finally, a comparison is performed among some families of protocol sequences constructed by means of CP codes