2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/105721The 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.6 pagesCryptography and Securitytext