An Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF(p^m) with Period p^m

2011/09/21 by Jianqin Zhou, Wei Xiong, Zhou, Jianqin +1
Computer Science · Engineering · #Coding theory and cryptography #Cryptography and Residue Arithmetic #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1109.4459

openalex publication_date 2011/09/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The linear complexity (LC) of a sequence has been used as a convenient measure of the randomness of a sequence. Based on the theories of linear complexity, k-error linear complexity, the minimum error and the k-error linear complexity profile, the notion of m-tight error linear complexity is presented. An efficient algorithm for computing m-tight error linear complexity is derived from the algorithm for computing k-error linear complexity of sequences over GF(p^m) with period pⁿ, where p is a prime. The validity of the algorithm is shown. The algorithm is also realized with C language, and an example is presented to illustrate the algorithm.

Related

• An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
• Periodic sequences with stable k-error linear complexity
• On error linear complexity of new generalized cyclotomic binary sequences of period p²
• Efficient Algorithm for the Linear Complexity of Sequences and Some\n Related Consequences
• On the k-error linear complexity for pⁿ-periodic binary sequences via hypercube theory