New Bounds for Binary and Ternary Overloaded CDMA

Simple item page
dc.creatorDashmiz, Sh.
dc.creatorPad, P.
dc.creatorMarvasti, F.
dc.date2009-01-13
dc.date2009-01-15
dc.date.accessioned2026-07-07T12:29:26Z
dc.date.available2026-07-07T12:29:26Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/0901.1683
dc.identifierhttp://arxiv.org/abs/0901.1683
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/215878
dc.subjectInformation Theory
dc.subjectDiscrete Mathematics
dc.subjectCombinatorics
dc.titleNew Bounds for Binary and Ternary Overloaded CDMA
dc.typetext

Files

Collections

arXiv