The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Optimal sequences and sum capacity of synchronous CDMA systems
Abstract
The sum capacity of a multiuser synchronous CDMA system is completely characterized in the general case of asymmetric user power constraints-this solves the open problem posed by Rupf and Massey (see ibid., vol.40, p.1261-6, 1994) which had solved the equal power constraint case. We identify the signature sequences with real components that achieve sum capacity and indicate a simple recursive algorithm to construct them.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Inequalities: Theory of Majorization and its Applications.
Arnold, B. C., Marshall, A. W., & Olkin, I. (1981) · Journal of the American Statistical Association · doi:10.2307/2287859 · Cited by 4,870
Inequalities - Theory of Majorization and Its Applications
(1979) · Mathematics in Science and Engineering · doi:10.1016/c2009-0-22048-4 · Cited by 2,870
Lower bounds on the maximum cross correlation of signals (Corresp.)
Welch, L. (1974) · IEEE Transactions on Information Theory · doi:10.1109/tit.1974.1055219 · Cited by 1,291
Viswanath, P., Anantharam, V., & Tse, D. N. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782119 · Cited by 420
Self-citationWelch’s Bound and Sequence Sets for Code-Division Multiple-Access Systems
Massey, J. L., & Mittelholzer, T. (1993) · Sequences II · doi:10.1007/978-1-4613-9323-8_7 · Cited by 218
Cited by
Iterative Water-Filling for Gaussian Vector Multiple-Access Channels
Yu, W., Rhee, W., Boyd, S., & Cioffi, J. M. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.821988 · Cited by 1,026
Spectral efficiency of CDMA with random spreading
Verdu, S., & Shamai, S. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.749007 · Cited by 885
Novel Low-Density Signature for Synchronous CDMA Systems Over AWGN Channel
Hoshyar, R., Wathan, F. P., & Tafazolli, R. (2008) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2007.909320 · Cited by 654
Designing structured tight frames via an alternating projection method
Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839492 · Cited by 494
Viswanath, P., Anantharam, V., & Tse, D. N. C. (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.782119 · Cited by 420
Self-citationRong, Y., Tang, X., & Hua, Y. (2009) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2009.2027779 · Cited by 363
Life Beyond Bases: The Advent of Frames (Part I)
Kovacevic, J., & Chebira, A. (2007) · IEEE Signal Processing Magazine · doi:10.1109/msp.2007.4286567 · Cited by 341
MIMO Transceiver Design via Majorization Theory
Palomar, D. P., & Jiang, Y. (2007) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000018 · Cited by 320
Space‐Time Processing for MIMO Communications
(2005) · Wiley eBooks · doi:10.1002/0470010045 · Cited by 319
Enhanced uplink non-orthogonal multiple access for 5G and beyond systems
Liu, W.-J., Hou, X.-L., & Chen, L. (2018) · Frontiers of Information Technology & Electronic Engineering · doi:10.1631/fitee.1700842 · Cited by 21
Metadata
- Authors
- Viswanath, P., & Anantharam, V.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1999
- Volume
- 45
- Issue
- 6
- Pages
- 1984-1991
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2003010976
- Cited by
- 321
- References
- 6
- FWCI
- 21.93
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.