IEEE - Institute of Electrical and Electronics Engineers, Inc. - On the Computation of the Linear Complexity of a Sequence over GF(q) with Period qnpm

2008 ISECS International Colloquium on Computing, Communication, Control, and Management (CCCM)

Author(s): Jianqin Zhou ; Jinzhong Li
Publisher: IEEE - Institute of Electrical and Electronics Engineers, Inc.
Publication Date: 1 August 2008
Conference Location: Guangzhou, China
Conference Date: 3 August 2008
Volume: 1
Page(s): 745 - 749
ISBN (Paper): 978-0-7695-3290-5
DOI: 10.1109/CCCM.2008.178
Regular:

A fast algorithm is derived for determining the linear complexity and the minimal polynomial of sequences over GF(q) with period qnpm, where p is a prime number, q is a prime number and a... View More

Advertisement