Mapping prefer-opposite to prefer-one de Bruijn sequences

DOI10.1007/s10623-016-0322-4zbMath1380.68326OpenAlexW2563737235MaRDI QIDQ1675290

Amir Rubin, Gera Weiss

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

zbMATH Keywords

de Bruijn sequencesprefer oneprefer opposite

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (2)

A relation between sequences generated by Golomb's preference algorithm ⋮ On the \(k\)-error linear complexities of De Bruijn sequences

Cites Work

• Unnamed Item
• A Simple Combinatorial Algorithm for de Bruijn Sequences
• A problem in arrangements
• On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers

This page was built for publication: Mapping prefer-opposite to prefer-one de Bruijn sequences