An algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)

2005/12/10 by Jianqin Zhou, Zhou, Jianqin, Xirong Xu +1
Computer Science · Engineering · #Cellular Automata and Applications #Coding theory and cryptography #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.cs/0512039

6 pages

arxiv created 2005/12/10 · openalex publication_date 2005/12/10 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The union cost is used, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2pn over GF(q) is presented, where p and q are odd primes, and q is a primitive root of modulo p2.

Related

• A fast algorithm for determining the linear complexity of periodic sequences
• An Algorithm for Computing m-Tight Error Linear Complexity of Sequences over GF(p^m) with Period p^m
• On k-error linear complexity of binary sequences derived from Euler quotients modulo 2p
• On error linear complexity of new generalized cyclotomic binary sequences of period p²
• Periodic sequences with stable k-error linear complexity