A relation between sequences generated by Golomb's preference algorithm
From MaRDI portal
Recommendations
- A greedy algorithm for \(B_h[g]\) sequences
- On a Golay-Shapiro-like sequence
- On Golay sequences
- A sequences analog of the Piatetski-Shapiro problem
- A generalization of Gosper's algorithm
- scientific article; zbMATH DE number 775000
- Sequences with low discrepancy generalisation and application to bobbins-monbo algorithm
- The number of preference orderings: a recursive approach
- Relations between sequences and selection properties
- scientific article; zbMATH DE number 4105015
Cites work
- A problem in arrangements
- A simple combinatorial algorithm for de Bruijn sequences
- A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
- Cryptographically Strong de Bruijn Sequences with Large Periods
- Mapping prefer-opposite to prefer-one de Bruijn sequences
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers
- On greedy algorithms for binary de Bruijn sequences
- On the cycle structure of some nonlinear shift register sequences
- Spans of preference functions for de Bruijn sequences
- Stretching de Bruijn sequences
Cited in
(3)
This page was built for publication: A relation between sequences generated by Golomb's preference algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2678989)