Let $\widetilde {\alpha} $ be a length-$ L $ cyclic sequence of characters from a size-$ K $
alphabet $\mathcal {A} $ such that the number of occurrences of any length-$ m $ string on …

In this paper, we study the construction of de Bruijn sequences. A method is given to stretch
a de Bruijn sequence of order n to a de Bruijn sequence of order n+ k with the help of a k …

In a recent paper (DCC, Rubin and Weiss in 85: 547–555, 2017), based on the
differentiation operator, Rubin and Weiss proposed a mapping of the binary prefer-opposite …

M 序列反馈函数多项式表示的快速构造方法Method of fast construction of M-sequence
feedback functions with polyn Page 1 2018 年4 月 Journal on Communications April 2018 …

We study the adjacency graphs of feedback shift registers (FSRs) with affine characteristic
functions. We first show that, similar to the linear case, the output sequences of FSRs with …

We study the cross-join pairs in the cycles of linear feedback shift registers whose
characteristic polynomials are of the form, where are primitive polynomials of coprime …

We propose a novel construction for the well-known prefer-max De Bruijn sequence, based
on the cycle joining technique. We further show that the construction implies known results …

De Bruijn sequences and l-sequences are defined to be the maximum-period sequences
generated by feedback shift registers (FSRs) and feedback with carry shift registers …

Nonlinear feedback shift registers (NFSRs) are widely used as building blocks in the design
of stream ciphers. Let NFSR (f) be an NFSR with the characteristic function f and let G (f) be …

We study the k-error linear complexities of de Bruijn sequences. Let n be a positive integer
and k be an integer less than ⌈ 2^ n-1 n ⌉⌈ 2 n-1 n⌉. We show that the k-error linear …