19 citations · 47 across the 12 of their papers we have counts for
11 papers · 1 filter
Five Constructions of Asymptotically Optimal Aperiodic Doppler Resilient Complementary Sequence Sets with New Parameters
Xuanyu Liu, Pinhui Ke, Zuling Chang
Sequences exhibiting favorable ambiguity function characteristics play a critical role in radar detection systems and modern mobile communication applications. As a newly developed…
Three Families of Projective Binary Linear Codes of at Most Four Weights
Tonghui Zhang, Pinhui Ke, Zuling Chang
Three classes of binary linear codes with at most four nonzero weights were constructed in this paper, in which two of them are projective three-weight codes. As applications, -…
A Graph Joining Greedy Approach to Binary de Bruijn Sequences
Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza +1
Using greedy algorithms to generate de Bruijn sequences is a classical approach that has produced numerous interesting theoretical results. This paper investigates an algorithm whi…
An Efficiently Generated Family of Binary de Bruijn Sequences
Yunlong Zhu, Zuling Chang, Martianus Frederic Ezerman +1
We study how to generate binary de Bruijn sequences efficiently from the class of simple linear feedback shift registers with feedback function $f(x_0, x_1, \ldots, x_{n-1}) = x_0…
New Successor Rules to Efficiently Produce Exponentially Many Binary de Bruijn Sequences
Zuling Chang, Martianus Frederic Ezerman, Pinhui Ke +1
We put forward new general criteria to design successor rules that generate binary de Bruijn sequences. Prior fast algorithms based on successor rules in the literature are then sh…
On Greedy Algorithms for Binary de Bruijn Sequences
Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza
We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback fu…
Binary de Bruijn Sequences via Zech's Logarithms
Zuling Chang, Martianus Frederic Ezerman, Adamas Aqsa Fahreza +3
The focus of this work is to show how to combine Zech's logarithms and each of the cycle joining and cross-join pairing methods to construct binary de Bruijn sequences of any order…
The Cycle Structure of LFSR with Arbitrary Characteristic Polynomial over Finite Fields
Zuling Chang, Martianus Frederic Ezerman, San Ling +1
We determine the cycle structure of linear feedback shift register with arbitrary monic characteristic polynomial over any finite field. For each cycle, a method to find a state an…
On Binary de Bruijn Sequences from LFSRs with Arbitrary Characteristic Polynomials
Zuling Chang, Martianus Frederic Ezerman, San Ling +1
We propose a construction of de Bruijn sequences by the cycle joining method from linear feedback shift registers (LFSRs) with arbitrary characteristic polynomial . We study…
Rates of DNA Sequence Profiles for Practical Values of Read Lengths
Zuling Chang, Johan Chrisnata, Martianus Frederic Ezerman +1
A recent study by one of the authors has demonstrated the importance of profile vectors in DNA-based data storage. We provide exact values and lower bounds on the number of profile…
Construction of de Bruijn Sequences from Product of Two Irreducible Polynomials
Zuling Chang, Martianus Frederic Ezerman, San Ling +1
We study a class of Linear Feedback Shift Registers (LFSRs) with characteristic polynomial where and are distinct irreducible polynomials in $\F_2[x]$…