Title :
On the linear complexity of nonuniformity decimated PN-sequences
Author :
Golic, Jovan Dj ; Zivkovic, Miodrag V.
Author_Institution :
Inst. of Appl. Math. & Electron., Belgrade, Yugoslavia
fDate :
9/1/1988 12:00:00 AM
Abstract :
A lower bound is derived on the probability that when a PN-sequence of period N=2n-1 is nonuniformly decimated by means of a sequence whose period divides M, the decimated sequence will have maximum linear complexity nM. It is shown that by choosing M and n appropriately, this probability can be made arbitrarily close to one with nM arbitrarily large
Keywords :
binary sequences; boundary-value problems; information theory; probability; linear complexity; lower bound; nonuniformity decimated PN-sequences; probability; shift register sequences; Binary sequences; Linear feedback shift registers; Mathematics; Polynomials; Probability distribution; State feedback;
Journal_Title :
Information Theory, IEEE Transactions on
