Treffer: On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences
Title:
On the generalized Lauder-Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences
Authors:
Source:
SETA 2004 : sequences and their applications (Seoul, 24-28 October 2004, revised selected papers)Lecture notes in computer science. :166-178
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 13 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Analyse séquence, Sequence analysis, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Séquence binaire, Binary sequence, Secuencia binaria
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Information and Electronic Engineering, Yatsushiro National College of Technology, Yatsushiro, Kumamoto 866-8501, Japan
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.16923684
Database:
PASCAL Archive
Weitere Informationen
The Lauder-Paterson algorithm gives the profile of the k-error linear complexity for a binary sequence with period 2. In this paper a generalization of the Lauder-Paterson algorithm into a sequence over GF(pm) with period p, 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.