|
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.
Received: 14.11.2020
Citation:
V. A. Edemskiy, “Analysis of linear complexity of generalized cyclotomic $q$-ary sequences of $p^n$ period”, Vestn. Astrakhan State Technical Univ. Ser. Management, Computer Sciences and Informatics, 2021, no. 1, 70–79
Linking options:
https://www.mathnet.ru/eng/vagtu662 https://www.mathnet.ru/eng/vagtu/y2021/i1/p70
|
Statistics & downloads: |
Abstract page: | 70 | Full-text PDF : | 84 | References: | 10 |
|