The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
An analysis of the structure and complexity of nonlinear binary sequence generators
Abstract
A method of analysis is presented for the class of binary sequence generators employing linear feedback shift registers with nonlinear feed-forward operations. This class is of special interest because the generators are capable of producing very long "unpredictable" sequences. The period of the sequence is determined by the linear feedback connections, and the portion of the total period needed to predict the remainder is determined by the nonlinear feed-forward operations. The linear feedback shift registers are represented in terms of the roots of their characteristic equations in a finite field, and it is shown that nonlinear operations inject additional roots into the representation. The number of roots required to represent a generator is a measure of its complexity, and is equal to the length (number of stages) of the shortest linear feedback shift register that produces the same sequence. The analysis procedure can be applied to any arbitrary combination of binary shift register generators, and is also applicable to the synthesis of complex generators having desired properties. Although the discussion in this paper is limited to binary sequences, the analysis is easily extended to similar devices that generate sequences with members in any finite field.
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
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
Cattermole, K. W. (1968) · Electronics and Power · doi:10.1049/ep.1968.0141 · Cited by 1,319
Linear Groups with an Exposition of the Galois Field Theory
Dickson, L. E., & Gillis, J. (1959) · Physics Today · doi:10.1063/1.3060528 · Cited by 653
Abbott, J. H., & Peterson, W. W. (1962) · The American Mathematical Monthly · doi:10.2307/2312168 · Cited by 227
Fundamental Concepts of Higher Algebra.
MacDuffee, C. C., & Albert, A. A. (1957) · American Mathematical Monthly · doi:10.2307/2308856 · Cited by 119
HOW TO PROTECT DATA WITH CIPHERS THAT ARE REALLY HARD TO BREAK
Geffe, P. R. (1973) · Cited by 94
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Theory of Spread-Spectrum Communications - A Tutorial
Pickholtz, R., Schilling, D., & Milstein, L. (1982) · IEEE Transactions on Communications · doi:10.1109/tcom.1982.1095533 · Cited by 1,370
Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
Siegenthaler, T. (1984) · IEEE Transactions on Information Theory · doi:10.1109/tit.1984.1056949 · Cited by 680
Privacy and authentication: An introduction to cryptography
Diffie, W., & Hellman, M. E. (1979) · Proceedings of the IEEE · doi:10.1109/proc.1979.11256 · Cited by 470
Metadata
- Authors
- Key, E.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1976-11
- Volume
- 22
- Issue
- 6
- Pages
- 732-736
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2150276672
- Cited by
- 259
- References
- 7
- FWCI
- 1.10
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An analysis of the structure and complexity of nonlinear binary sequence generators. https://app.cochat.ai/papers/10.1109/tit.1976.1055626
- The paper
- Key, E. (1976). An analysis of the structure and complexity of nonlinear binary sequence generators. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1976.1055626
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.