Pages that link to "Item:Q1841913"
From MaRDI portal
The following pages link to De Bruijn sequences with efficient decoding algorithms (Q1841913):
Displaying 9 items.
- An efficient shift rule for the prefer-max de Bruijn sequence (Q1618243) (← links)
- De Bruijn sequences and suffix arrays: analysis and constructions (Q1624990) (← links)
- Computing generalized de Bruijn sequences (Q1680534) (← links)
- Storage efficient decoding for a class of binary de Bruijn sequences (Q1842178) (← links)
- Multi de Bruijn sequences (Q2404822) (← links)
- Efficient ranking of Lyndon words and decoding lexicographically minimal de Bruijn sequence (Q2830442) (← links)
- Cryptographically Strong de Bruijn Sequences with Large Periods (Q3455491) (← links)
- DE BRUIJN SEQUENCES REVISITED (Q4923282) (← links)
- On a Construction of Easily Decodable Sub-de Bruijn Arrays (Q4973253) (← links)