On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences

Authors:
Takayasu Kaida
Affiliations:
Department of Information and Electronic Engineering, Yatsushiro National College of Technology, Yatsushiro, Kumamoto, Japan
Venue:
SETA'04 Proceedings of the Third international conference on Sequences and Their Applications
Year:
2004

Citing 4
Cited 1

An algorithm for the k-error linear complexity of sequences over GF(pm) with period pn, p a prime

Information and Computation
Linear complexity for one-symbol substitution of a periodic sequence over GF(q)

IEEE Transactions on Information Theory
A relationship between linear complexity and k-error linear complexity

IEEE Transactions on Information Theory
Computing the error linear complexity spectrum of a binary sequence of period 2n

IEEE Transactions on Information Theory

Remarks on the k-error linear complexity of pn-periodic sequences

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Lauder-Paterson algorithm gives the profile of the k-error linear complexity for a binary sequence with period 2n. In this paper a generalization of the Lauder-Paterson algorithm into a sequence over GF(pm) with period pn, where p is a prime and m, n are positive integers, is proposed. We discuss memory and computation complexities of proposed algorithm. Moreover numerical examples of profiles for balanced binary and ternary exponent periodic sequences, and proposed algorithm for a sequence over GF(3) with period 9(= 32) are given.