Signature coding for OR channel with asynchronous access
<|reference_start|>Signature coding for OR channel with asynchronous access: 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.<|reference_end|>
@article{győri2005signature,
    title={Signature coding for OR channel with asynchronous access},
    author={S'andor GyH{o}ri},
    journal={arXiv preprint arXiv:cs/0508025},
    year={2005},
    archivePrefix={arXiv},
    eprint={cs/0508025},
    primaryClass={cs.IT math.IT}
}