On the Capacity of the Slotted Strongly Asynchronous Channel with a Bursty User

The slotted strongly asynchronous channel with a bursty user consists of a window of An = enα blocks of length n channel uses. A user transmits a randomly selected message among Mn = enR different ones in exactly Kn = env randomly selected but distinct blocks in the window. The receiver must locate and decode, with vanishing error probability in n, each one of the transmitted messages. The optimal tradeoff between (R, α, ν) is derived.