The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Theory of Spread-Spectrum Communications - A Tutorial
Abstract
Spread-spectrum communications, with its inherent interference attenuation capability, has over the years become an increasingly popular technique for use in many different systems. Applications range from antijam systems, to code division multiple access systems, to systems designed to combat multipath. It is the intention of this paper to provide a tutorial treatment of the theory of spread-spectrum communications, including a discussion on the applications referred to above, on the properties of common spreading sequences, and on techniques that can be used for acquisition and tracking.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Algebraic Coding Theory: Revised Edition
Berlekamp, E. R. (2015) · WORLD SCIENTIFIC eBooks · doi:10.1142/9407 · Cited by 2,474
Shift-register synthesis and BCH decoding
Massey, J. (1969) · IEEE Transactions on Information Theory · doi:10.1109/tit.1969.1054260 · Cited by 2,186
Golomb, S. W. (2017) · WORLD SCIENTIFIC eBooks · doi:10.1142/9361 · Cited by 2,180
Principles of Communication Engineering
Jacobs, I. M., & Wozencraft, J. M. (1965) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,912
Stiffler, J. J. (1971) · Cited by 1,438
Cattermole, K. W. (1968) · Electronics and Power · doi:10.1049/ep.1968.0141 · Cited by 1,319
Bruijn, D. N. D. (1946) · TU/e Research Portal · Cited by 1,289
Optimal binary sequences for spread spectrum multiplexing (Corresp.)
Gold, R. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054048 · Cited by 849
Dixon, R. (1976) · Medical Entomology and Zoology · Cited by 606
The Origins of Spread-Spectrum Communications
Scholtz, R. (1982) · IEEE Transactions on Communications · doi:10.1109/tcom.1982.1095547 · Cited by 298
An analysis of the structure and complexity of nonlinear binary sequence generators
Key, E. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055626 · Cited by 259
Spread spectrum communications--Myths and realities
Viterbi, A. (1979) · IEEE Communications Magazine · doi:10.1109/mcom.1979.1089969 · Cited by 242
An analysis of the pseudo-randomness properties of subsequences of longm-sequences
Lindholm, J. (1968) · IEEE Transactions on Information Theory · doi:10.1109/tit.1968.1054188 · Cited by 125
Stahnke, W. L. (1973) · Mathematics of Computation · doi:10.1090/s0025-5718-1973-0327722-7 · Cited by 100
Cited by
Secure spread spectrum watermarking for multimedia
Cox, I. J., Kilian, J., Leighton, F. T., & Shamoon, T. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.650120 · Cited by 5,299
Secure routing in wireless sensor networks: attacks and countermeasures
Karlof, C., & Wagner, D. (2003) · Ad Hoc Networks · doi:10.1016/s1570-8705(03)00008-8 · Cited by 2,937
Pursley, M. B. (2002) · Reference Data for Engineers · doi:10.1016/b978-075067291-7/50026-1 · Cited by 2,779
Petitcolas, F. A. P., Anderson, R. J., & Kuhn, M. G. (1999) · Proceedings of the IEEE · doi:10.1109/5.771065 · Cited by 2,546
Win, M. Z., & Scholtz, R. A. (2000) · IEEE Transactions on Communications · doi:10.1109/26.843135 · Cited by 2,526
Metadata
- Authors
- Pickholtz, R., Schilling, D., & Milstein, L.
- Venue
- IEEE Transactions on Communications
- Published
- 1982-05
- Volume
- 30
- Issue
- 5
- Pages
- 855-884
- ISSN
- 0090-6778 (ISSN-L)
- OpenAlex
- W2095975429
- Cited by
- 1,370
- References
- 14
- FWCI
- 10.97
- 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.