A New Approach to Determine the Minimal Polynomials of Binary Modified de Bruijn Sequences

02/03/2022
by   Musthofa, et al.
0

A binary modified de Bruijn sequence is an infinite and periodic binary sequence derived by removing a zero from the longest run of zeros in a binary de Bruijn sequence. The minimal polynomial of the modified sequence is its unique least-degree characteristic polynomial. Leveraging on a recent characterization, we devise a novel general approach to determine the minimal polynomial. We translate the characterization into a problem of identifying a Hamiltonian cycle in a specially constructed graph. Along the way, we demonstrate the usefullness of computational tools from the cycle joining method in the modified setup.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2022

A Note on the Games-Chan Algorithm

The Games-Chan algorithm finds the minimal period of a periodic binary s...
research
06/19/2019

Linear Complexity of A Family of Binary pq^2-periodic Sequences From Euler Quotients

We first introduce a family of binary pq^2-periodic sequences based on t...
research
03/20/2020

An Efficiently Generated Family of Binary de Bruijn Sequences

We study how to generate binary de Bruijn sequences efficiently from the...
research
08/17/2020

Optimal minimal Linear codes from posets

Recently, some infinite families of minimal and optimal binary linear co...
research
06/28/2023

Permutation Polynomial Interleaved Zadoff-Chu Sequences

Constant amplitude zero autocorrelation (CAZAC) sequences have modulus o...
research
11/12/2022

Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks

In the context of reconstructing phylogenetic networks from a collection...
research
04/04/2018

A Euclidean Algorithm for Binary Cycles with Minimal Variance

The problem is considered of arranging symbols around a cycle, in such a...

Please sign up or login with your details

Forgot password? Click here to reset