An Efficient Algorithm for Computing the k-Error Linear Complexity Spectrum of Periodic Sequences

Ling Yong Ma; Hao Cao

doi:10.4028/www.scientific.net/AMR.532-533.1726

Paper Titles

A New Hybrid Image Reconstruction Algorithm for Magnetic Induction Tomography
p.1706

Evolutionary Algorithm Research Based on Neural Network for Fuzzy Cognitive Map
p.1711

Short Text Clustering Algorithm with Feature Keyword Expansion
p.1716

An Improved IPP Planning Algorithm and the Application
p.1721

An Efficient Algorithm for Computing the k-Error Linear Complexity Spectrum of Periodic Sequences
p.1726

A Novel Filtering Algorithm Based on Least Square Support Vector
p.1732

Complex Relationship Mining Algorithm and its Application
p.1736

Fast Multilevel Thresholding Method for Image Segmentation Based on Improved Particle Swarm Optimization and Maximal Variance
p.1741

A Robust Star Acquisition Algorithm Based on Facet Model
p.1747

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 532-533An Efficient Algorithm for Computing the k-Error...

An Efficient Algorithm for Computing the k-Error Linear Complexity Spectrum of Periodic Sequences

Abstract:

An efficient algorithm for computing the k-error linear complexity spectrum of a q- ary sequence s with period 2 pⁿ is presented, where q is an odd prime and a primitive root modulo p². The algorithm generalizes both the Wei-Xiao-Chen and the Wei algorithms, The new algorithm can compute the k-error linear complexity spectrum of s using at most 4 ⁿ⁺¹ steps.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 532-533)

Pages:

1726-1731

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.532-533.1726

Citation:

Cite this paper

Online since:

June 2012

Authors:

Ling Yong Ma, Hao Cao

Keywords:

Algorithm (GA), k-Error Linear Complexity Spectrum, Periodic Sequence

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Stamp M, Martin C F. An Algorithm for the k-error Linear Complexity of Binary Sequences of Period 2n [J ] . IEEE Trans on IT, 1993 , 39 (4) : 1398-1401.

DOI: 10.1109/18.243455

Google Scholar

[2] Lauder A , Paterson K. Computing the Error Linear Complexity Spectrum of a Binary Sequences of Period2n [J ] . IEEE Trans on IT, 2003 , 49(1) : 273-280.

DOI: 10.1109/tit.2002.806136

Google Scholar

[3] Wei S, Xiao G, Chen Z. A fast algorithm for determining the minimal polynomial of a sequence with period 2pn over GF(q) [J]. IEEE Trans on Information Theory, 2002, 48(10): 2754-2758.

DOI: 10.1109/tit.2002.802609

Google Scholar

[4] Wei S. A fast algorithm for computing the k-error linear comlexity of period sequence [J]. Chinese Journal of Electronics, 2004, 32（5）: 2-5.

Google Scholar

[5] Bai Enjian, Liu Xiaojuan, Xiao Guozhen. A fast algorithm for computing the k-error linear comlexity profile of binary sequence with period pn [J]. Journal on communications, 2004, 25 （10），1-7.

Google Scholar

[6] Bai Enjian, Tan Shichong, Xiao Guozhen. A fast algorithm for computing the k-error linear comlexity profile of binary sequence with period pn [J]. Journal of Xidian University(Natural Science), 2004, 31（3）, 388-393.

Google Scholar