TY - JOUR
T1 - A relation between sequences generated by Golomb’s preference algorithm
AU - Jiang, Yupeng
N1 - Publisher Copyright:
© 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2023/1
Y1 - 2023/1
N2 - In a recent paper (DCC, Rubin and Weiss in 85:547–555, 2017), based on the differentiation operator, Rubin and Weiss proposed a mapping of the binary prefer-opposite de Bruijn sequence of order n onto the binary prefer-one de Bruijn sequence of order n- 1. Both prefer-opposite and prefer-one de Bruijn sequences can be regarded as special cases of sequences generated by Golomb’s preference algorithm. In this paper, we introduce inertia function in Golomb’s preference algorithm, and then applying it to extend Rubin and Weiss’s result to more general cases.
AB - In a recent paper (DCC, Rubin and Weiss in 85:547–555, 2017), based on the differentiation operator, Rubin and Weiss proposed a mapping of the binary prefer-opposite de Bruijn sequence of order n onto the binary prefer-one de Bruijn sequence of order n- 1. Both prefer-opposite and prefer-one de Bruijn sequences can be regarded as special cases of sequences generated by Golomb’s preference algorithm. In this paper, we introduce inertia function in Golomb’s preference algorithm, and then applying it to extend Rubin and Weiss’s result to more general cases.
KW - Inertia function
KW - Prefer-one sequence
KW - Preference function
UR - https://www.scopus.com/pages/publications/85137527275
U2 - 10.1007/s10623-022-01108-1
DO - 10.1007/s10623-022-01108-1
M3 - 文章
AN - SCOPUS:85137527275
SN - 0925-1022
VL - 91
SP - 285
EP - 291
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
IS - 1
ER -