中文
相关论文

相关论文: Corrigendum to New Generalized Cyclotomic Binary S…

200 篇论文

A linear recurrence sequence in a cyclotomic field produces a sequence of the generating fields of each term. We show that the later sequence is periodic after removing the first finite terms, and give a bound of its period. This can be…

数论 · 数学 2021-10-05 Shenxing Zhang

Binary Sidel'nikov-Lempel-Cohn-Eastman sequences (or SLCE sequences) over F 2 have even period and almost perfect autocorrelation. However, the evaluation of the linear complexity of these sequences is really difficult. In this paper, we…

信息论 · 计算机科学 2017-02-21 Qi Zhang , Jing Yang

We describe the trace representations of two families of binary sequences derived from Fermat quotients modulo an odd prime $p$ (one is the binary threshold sequences, the other is the Legendre-Fermat quotient sequences) via determining the…

数论 · 数学 2016-03-15 Zhixiong Chen

Traditional global stability measure for sequences is hard to determine because of large search space. We propose the $k$-error linear complexity with a zone restriction for measuring the local stability of sequences. Accordingly, we can…

信息论 · 计算机科学 2019-03-29 Ming Su , Qiang Wang

This paper investigates cross correlation properties of sequences derived from GH sequences modulo p, where p is a prime number and presents comparison with cross correlation properties of pseudo noise sequences. For GH sequences modulo…

密码学与安全 · 计算机科学 2015-05-13 Krishnamurthy Kirthi

In this paper we study the Fibonacci numbers and derive some interesting properties and recurrence relations. We prove some charecterizations for $F_p$, where $p$ is a prime of a certain type. We also define period of a Fibonacci sequence…

数论 · 数学 2015-06-11 Alexandre Laugier , Manjil P. Saikia

Pseudorandom number generators are required to generate pseudorandom numbers which have good statistical properties as well as unpredictability in cryptography. An m-sequence is a linear feedback shift register sequence with maximal period…

信息论 · 计算机科学 2018-12-26 Kazuyoshi Tsuchiya , Chiaki Ogawa , Yasuyuki Nogami , Satoshi Uehara

In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…

组合数学 · 数学 2021-03-02 Ghurumuruhan Ganesan

Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…

数论 · 数学 2013-02-07 Zhi-Hong Sun

We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…

组合数学 · 数学 2026-03-20 Abbas Alhakim , Chris J. Mitchell , Janusz Szmidt , Peter R. Wild

We build a new theory for analyzing the coefficients of any cyclotomic polynomial by considering it as a gcd of simpler polynomials. Using this theory, we generalize a result known as periodicity and provide two new families of flat…

数论 · 数学 2012-07-26 Sam Elder

Quaternary sequences of both even and odd period having low autocorrelation are studied. We construct new families of balanced quaternary sequences of odd period and low autocorrelation using cyclotomic classes of order eight, as well as…

组合数学 · 数学 2017-11-08 Jerod Michel , Qi Wang

Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…

综合数学 · 数学 2009-09-15 Shaohua Zhang

Binary Whiteman's cyclotomic sequences of orders 2 and 4 have a number of good randomness properties. In this paper, we compute the autocorrelation values and linear complexity of the first class two-prime Whiteman's generalized cyclotomic…

信息论 · 计算机科学 2015-09-28 Pramod Kumar Kewat , Priti Kumari

We investigate the $k$-error linear complexity over $\mathbb{F}_p$ of binary sequences of length $2p$ with optimal three-level autocorrelation. These balanced sequences are constructed by cyclotomic classes of order four using a method…

密码学与安全 · 计算机科学 2020-01-08 Vladimir Edemskiy

The 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.

密码学与安全 · 计算机科学 2007-05-23 Jianqin Zhou , Xirong Xu

We fully classify completely multiplicative sequences which are given by generalised polynomial formulae, and obtain a similar result for (not necessarily completely) multiplicative sequences under the additional restriction that the…

数论 · 数学 2024-03-27 Jakub Konieczny

We investigate the linear complexities of the periodic 0-1 infinite sequences in which the periods are the sequence of the parities of the spacings between quadratic residues modulo a prime p, and the sequence of the parities of the…

信息论 · 计算机科学 2019-05-07 Mihai Caragiu , Shannon Tefft , Aaron Kemats , Travis Maenle

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

组合数学 · 数学 2024-04-10 Jonas Frede , Volker Kaibel , Maximilian Merkert

Gorenstein isolated quotient singularities of odd prime dimension are cyclic. In the case where the dimension is bigger than 1 and is not an odd prime number, then there exist Gorenstein isolated non-cyclic quotient singularities.

交换代数 · 数学 2011-04-26 Kazuhiko Kurano , Shougo Nishi