New Bounds for Binary and Ternary Overloaded CDMA

Details New Bounds for Binary and Ternary Overloaded CDMA New Bounds for Binary and Ternary Overloaded CDMA

2009-01-13

arxiv.org/abs/0901.1683v2

Computer Science

Information Theory

Scientific paper

In this paper, we study binary and ternary matrices that are used for CDMA applications that are injective on binary or ternary user vectors. In other words, in the absence of additive noise, the interference of overloaded CDMA can be removed completely. Some new algorithms are proposed for constructing such matrices. Also, using an information theoretic approach, we conjecture the extent to which such CDMA matrix codes exist. For overloaded case, we also show that some of the codes derived from our algorithms perform better than the binary Welch Bound Equality codes; the decoding is ML but of low complexity.

Affiliated with

Also associated with

No associations

Rating

New Bounds for Binary and Ternary Overloaded CDMA 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 New Bounds for Binary and Ternary Overloaded CDMA, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and New Bounds for Binary and Ternary Overloaded CDMA will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-374396