RUS  ENG
Full version
JOURNALS // Vestnik of Astrakhan State Technical University. Series: Management, Computer Sciences and Informatics // Archive

Vestn. Astrakhan State Technical Univ. Ser. Management, Computer Sciences and Informatics, 2021 Number 1, Pages 70–79 (Mi vagtu662)

MATHEMATICAL MODELING

Analysis of linear complexity of generalized cyclotomic $q$-ary sequences of $p^n$ period

V. A. Edemskiy

Yaroslav-the-Wise Novgorod State University, Veliky Novgorod, Russian Federation

Abstract: The article presents the analysis of the linear complexity of periodic $q$-ary sequences when changing $k$ of their terms per period. Sequences are formed on the basis of new generalized cyclotomy modulo equal to the degree of an odd prime. There has been obtained a recurrence relation and an estimate of the change in the linear complexity of these sequences, where $q$ is a primitive root modulo equal to the period of the sequence. It can be inferred from the results that the linear complexity of these sequences does not sign ificantly decrease when $k$ is less than half the period. The study summarizes the results for the binary case obtained earlier.

Keywords: $k$-error of linear complexity, cyclotomy, $q$-ary sequences.

UDC: 519.7

Received: 14.11.2020

DOI: 10.24143/2072-9502-2021-1-70-79



© Steklov Math. Inst. of RAS, 2024