Mapping prefer-opposite to prefer-one de Bruijn sequences
From MaRDI portal
Publication:1675290
DOI10.1007/s10623-016-0322-4zbMath1380.68326MaRDI QIDQ1675290
Publication date: 27 October 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-016-0322-4
68R15: Combinatorics on words
05A05: Permutations, words, matrices
68R10: Graph theory (including graph drawing) in computer science
94A55: Shift register sequences and sequences over finite alphabets in information and communication theory
Related Items
On the \(k\)-error linear complexities of De Bruijn sequences, A relation between sequences generated by Golomb's preference algorithm
Cites Work