Signature coding for OR channel with asynchronous access
Information Theory
2007-07-13 v1 math.IT
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.
Cite
@article{arxiv.cs/0508025,
title = {Signature coding for OR channel with asynchronous access},
author = {Sándor Győri},
journal= {arXiv preprint arXiv:cs/0508025},
year = {2007}
}
Comments
To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005