Signature coding for OR channel with asynchronous access

TL;DR

This paper investigates signature coding for multiple access OR channels with asynchronous access, showing that the minimum code length bounds are asymptotically similar to the synchronous case.

Contribution

It proves that in block asynchronous scenarios, the minimal code length bounds match those of synchronous access, extending understanding of OR channel coding.

Findings

Asymptotic code length bounds are the same for asynchronous and synchronous cases.

Theoretical analysis of signature coding in asynchronous OR channels.

Extension of coding bounds to asynchronous multiple access channels.

Abstract

Signature coding for multiple access OR channel is considered. We prove that in block asynchronous case the upper bound on the minimum code length asymptotically is the same as in the case of synchronous access.