Signature coding for OR channel with asynchronous access

Details Signature coding for OR channel with asynchronous access Signature coding for OR channel with asynchronous access

2005-08-03

arxiv.org/abs/cs/0508025v1

Computer Science

Information Theory

To appear in the proceedings of the 2005 IEEE International Symposium on Information Theory, Adelaide, Australia, September 4-

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Signature coding for OR channel with asynchronous access does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Signature coding for OR channel with asynchronous access, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Signature coding for OR channel with asynchronous access will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-39916