A relation between sequences generated by Golomb's preference algorithm

DOI10.1007/s10623-022-01108-1OpenAlexW4294860891WikidataQ114849646 ScholiaQ114849646MaRDI QIDQ2678989

Yupeng Jiang

Publication date: 18 January 2023

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-022-01108-1

zbMATH Keywords

preference functionprefer-one sequenceinertia function

Mathematics Subject Classification ID

Combinatorics on words (68R15) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Algorithms on strings (68W32)

Cites Work

• Spans of preference functions for de Bruijn sequences
• Mapping prefer-opposite to prefer-one de Bruijn sequences
• On greedy algorithms for binary de Bruijn sequences
• Stretching de Bruijn sequences
• A Simple Combinatorial Algorithm for de Bruijn Sequences
• Cryptographically Strong de Bruijn Sequences with Large Periods
• On the cycle structure of some nonlinear shift register sequences
• A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
• 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: A relation between sequences generated by Golomb's preference algorithm