Unsourced random-access (U-RA) is a type of grant-free random access with virtually unlimited number users, which only certain K a are active on the same time slot. Users employ exactly codebook, and task receiver to decode list transmitted messages. We present concatenated coding construction f...

............................................................................................................................................ 3 Acknowledgment .............................................................................................................................. 4 List of Figures .................................................................................................

The following problem was considered by Mueller [M]: Suppose we have a specialpurpose hardware device that enables us to son p numbers at a time, in time 0 (P). How can a conventional random access machine use such a device to son n numbers, n >p, in better than o(n logn) time? Clearly, it is impossible to hope for better than 0 (n logn/logp) time performance because of the Q(n logn) lower boWl...

We focus on authentication of bulk data dissemination in sensor networks using symmetric keys. By bulk data, we mean that the data is large enough that sufficient RAM memory cannot be allocated to store the data (due to limited memory as well as memory requirements from other parts of the code in the sensor). Hence, the data must be stored in EEPROM. Due to cost of write to EEPROM, this data mu...

The paper considers a random multiple access channel communication scenario with an unknown number of transmitters. The collection of active transmitters remains fixed during each epoch, but neither the transmitters nor the receiver know which subset of transmitters that is nor even the number of active transmitters. The receiver discerns from the channel output both the number of active transm...

Exploiting Application Behaviors for Resilient Static Random Access Memory Arrays in the Near-Threshold Computing Regime