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

Simple item page
dc.creatorZhou, Jianqin
dc.creatorXu, Xirong
dc.date2005-12-10
dc.date.accessioned2026-07-07T06:53:48Z
dc.date.available2026-07-07T06:53:48Z
dc.descriptionThe 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.
dc.description6 pages
dc.identifierhttps://arxiv.org/abs/cs/0512039
dc.identifierhttp://arxiv.org/abs/cs/0512039
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/105721
dc.subjectCryptography and Security
dc.titleAn algorithm for the k-error linear complexity of a sequence with period 2pn over GF(q)
dc.typetext

Files

Collections

arXiv