非同步访问下OR信道的签名编码
信息论
2007-07-13 v1 math.IT
摘要
考虑OR信道的签名编码。我们证明在块非同步情况下的最小码长渐近上界，与同步访问时的上界相同。
引用
@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}
}
备注
To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005