8 citations · 15 across the 5 of their papers we have counts for
5 papers
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…
Patch-Based Holographic Image Sensing
Alfred Marcel Bruckstein, Martianus Frederic Ezerman, Adamas Aqsa Fahreza +1
Holographic representations of data enable distributed storage with progressive refinement when the stored packets of data are made available in any arbitrary order. In this paper,…
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…
Holographic Sensing
Alfred Marcel Bruckstein, Martianus Frederic Ezerman, Adamas Aqsa Fahreza +1
Holographic representations of data encode information in packets of equal importance that enable progressive recovery. The quality of recovered data improves as more and more pack…
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…