Title :
Signature coding for OR channel with asynchronous access
Author_Institution :
Dept. of Comput. Sci. & Inf. Theor., Budapest Univ. of Technol. & Econ., Hungary
fDate :
6/27/1905 12:00:00 AM
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
Keywords :
"Upper bound","Envelope detectors","Decoding","Viterbi algorithm","Demodulation","Communication systems","Time sharing computer systems","Government"
Conference_Titel :
Information Theory, 2005. ISIT 2005. Proceedings. International Symposium on
Print_ISBN :
0-7803-9151-9
Electronic_ISBN :
2157-8117
DOI :
10.1109/ISIT.2005.1523704
