Pith. sign in

REVIEW

On Greedy Algorithms for Binary de Bruijn Sequences

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1902.08744 v2 pith:RPYARZZR submitted 2019-02-23 cs.IT cs.DSmath.COmath.IT

Zuling Chang , Martianus Frederic Ezerman , Adamas Aqsa Fahreza This is my paper · ORCID
classification cs.ITcs.DSmath.COmath.IT
keywords algorithmbinarybruijngreedysequencesalgorithmscalledcases
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite (GPO) Algorithm, and its modifications. By identifying specific feedback functions and initial states, we demonstrate that most previously-known greedy algorithms that generate binary de Bruijn sequences are particular cases of our new algorithm.

Discussion (0). Continue with ORCID to comment.

Pith tools