Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/further-results-on-correlation-functions-of-de-bruijn-sequences-w7HxL5S8sV
References (7)
-
R. Games (1983)
There Are No De Bruijn Sequences of Span n with Complexity 2n-1+n+1J. Comb. Theory, Ser. A, 34
-
T. Etzion, A. Lempel (1984)
On the distribution of de Bruijn sequences of given complexityIEEE Trans. Inf. Theory, 30
-
R. Games, A. Chan (1983)
A fast algorithm for determining the complexity of a binary sequence with period 2nIEEE Trans. Inf. Theory, 29
-
Z. Zhang (1982)
ON THE CORRELATION FUNCTIONS OF M-SEQUENCES -
S. Golomb, L. Welch (1957)
NONLINEAR SHIFT-REGISTER SEQUENCES -
W. D. Chen (1983)
Estimates of a Periodic Correlation Functions ofq-Elementsm-Sequences and Piecewise Linearization forM-SequencesJ. Sys. Sci. & Math. Scis., 3
-
A. Chan, R. Games, E. Key (1982)
On the Complexities of de Bruijn SequencesJ. Comb. Theory, Ser. A, 33
- Publisher
- Springer Journals
- Copyright
- Copyright © 1985 by Science Press and D. Reidel Publishing Company
- Subject
- Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
- ISSN
- 0168-9673
- eISSN
- 1618-3932
- DOI
- 10.1007/BF01666745
- Publisher site
- See Article on Publisher Site
Abstract
In this paper we develop some bounds for the correlation functions of sequences with period 2 n and specific linear complexities. These bounds are also applicable to the correlation functions of de Bruijn sequences with spann and specific linear complexities. It is interesting that a conjecture of Chan, Games and Key's for the case ofn=2 m can be proved easily by using the results developed here. Their conjecture asserts that there are no de Bruijn sequences with spann and linear complexity 2 n−1+n+1. The comjecture was proved by Games by a different method.
Journal
Acta Mathematicae Applicatae Sinica – Springer Journals
Published: Apr 26, 2005