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

Authors

page 1

page 2

page 3

page 4

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...
03/20/2020

An Efficiently Generated Family of Binary de Bruijn Sequences

We study how to generate binary de Bruijn sequences efficiently from the...
11/03/2015

Improved Polynomial Remainder Sequences for Ore Polynomials

Polynomial remainder sequences contain the intermediate results of the E...
08/05/2019

Minimal linear codes from characteristic functions

Minimal linear codes have interesting applications in secret sharing sch...
04/21/2021

The 1-1 algorithm for Travelling Salesman Problem

The Travelling Salesman Problem (TSP), finding a minimal weighted Hamilt...
11/08/2021

Simple odd β-cycle inequalities for binary polynomial optimization

We consider the multilinear polytope which arises naturally in binary po...
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...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.