Tight Bounds on the Capacity of Binary Input random CDMA Systems

Simple item page
dc.creatorKorada, Satish Babu
dc.creatorMacris, Nicolas
dc.date2008-03-10
dc.date.accessioned2026-07-07T09:25:58Z
dc.date.available2026-07-07T09:25:58Z
dc.descriptionWe consider multiple access communication on a binary input additive white Gaussian noise channel using randomly spread code division. For a general class of symmetric distributions for spreading coefficients, in the limit of a large number of users, we prove an upper bound on the capacity, which matches a formula that Tanaka obtained by using the replica method. We also show concentration of various relevant quantities including mutual information, capacity and free energy. The mathematical methods are quite general and allow us to discuss extensions to other multiuser scenarios.
dc.description34 pages
dc.identifierhttps://arxiv.org/abs/0803.1454
dc.identifierhttp://arxiv.org/abs/0803.1454
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156591
dc.subjectInformation Theory
dc.titleTight Bounds on the Capacity of Binary Input random CDMA Systems
dc.typetext

Files

Collections

arXiv