Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/146464| Title: | On greedy algorithms for binary de Bruijn sequences | Authors: | Chang, Zuling Ezerman, Martianus Frederic Fahreza, Adamas Aqsa |
Keywords: | Science::Mathematics | Issue Date: | 2020 | Source: | Chang, Z., Ezerman, M. F., & Fahreza, A. A. (2020). On greedy algorithms for binary de Bruijn sequences. Applicable Algebra in Engineering, Communication and Computing. doi:10.1007/s00200-020-00459-3 | Journal: | Applicable Algebra in Engineering, Communication and Computing | Abstract: | We propose a general greedy algorithm for binary de Bruijn sequences, called Generalized Prefer-Opposite 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 algorithm. | URI: | https://hdl.handle.net/10356/146464 | ISSN: | 1432-0622 | DOI: | 10.1007/s00200-020-00459-3 | Schools: | School of Physical and Mathematical Sciences | Rights: | © 2020 Springer. This is a post-peer-review, pre-copyedit version of an article published in Applicable Algebra in Engineering, Communication and Computing. The final authenticated version is available online at: http://dx.doi.org/10.1007/s00200-020-00459-3 | Fulltext Permission: | open | Fulltext Availability: | With Fulltext |
| Appears in Collections: | SPMS Journal Articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| dB_Greedy_AAECC.pdf | Author Accepted Manuscript; Embargo period 12 months | 286.8 kB | Adobe PDF |  View/Open |
SCOPUSTM
Citations
50
3
Updated on May 28, 2023
Web of ScienceTM
Citations
50
3
Updated on May 24, 2023
Page view(s)
155
Updated on Jun 1, 2023
Download(s) 50
69
Updated on Jun 1, 2023
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.