Signature coding for OR channel with asynchronous access

Simple item page
dc.creatorGyőri, Sándor
dc.date2005-08-03
dc.date.accessioned2026-07-07T08:15:33Z
dc.date.available2026-07-07T08:15:33Z
dc.descriptionSignature 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.
dc.descriptionTo appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-9, 2005
dc.identifierhttps://arxiv.org/abs/cs/0508025
dc.identifierhttp://arxiv.org/abs/cs/0508025
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133484
dc.subjectInformation Theory
dc.titleSignature coding for OR channel with asynchronous access
dc.typetext

Files

Collections

arXiv