On the least possible decoding error probability for truly asynchronous single sequence hopping

Unslotted asynchronous multiple access without feedback is considered. Poisson population, least length single sequence hopping and interleaved outer coding with guard spaces are assumed. Bounds from both sides on the least decoding error probability are proved to vanish with rate 1/k´ (from a given finite source block length k´ on) and under further conditions defined precisely by Csibi (see Proc. 1994 IEEE Internat. Symp. Inform Theory, Trondheim, Norway, p.290, 1994)