Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abraham L.: On a homomorphism of the de bruijn graph and its applications to the design of feedback shift registers. IEEE Trans. Comput. C 19(12), 1204–1209 (1970).
Alhakim A.M.: A simple combinatorial algorithm for de bruijn sequences. Am. Math. Mon. 117, 728–732 (2010).
Alhakim A.: Spans of preference functions for de bruijn sequences. Discret. Appl. Math. 160(7), 992–998 (2012).
Alhakim A., Nouiehed M.: Stretching de bruijn sequences. Des. Codes Crypt. 85, 381–394 (2017).
Chang, Z., Ezerman, M.F., Fahreza, A.A., Wang, Q.: A graph joining greedy approach to binary de bruijn sequences. (2020). arXiv:2004.09810
Chang, Z., Ezerman, M.F., Fahreza, A.A.: On greedy algorithms for binary de bruijn sequences. AAECC, 1–28 (2020). https://doi.org/10.1007/s00200-020-00459-3
Fredricksen H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195–221 (1982).
Green D.H., Dimond K.R.: Nonlinear product-feedback shift registers. Proc. IEE 117(4), 681–686 (1970).
Mandal K., Gong G.: Cryptographically strong de bruijn sequences with large periods. In: Knudsen L.R., Wu H. (eds.) Selected Areas in Cryptography, SAC 2012, vol. 7707, pp. 104–118. Lecture Notes in Computer Science. Springer, New York (2012).
Martin M.H.: A problem in arrangements. Bull. Am. Math. Soc. 40(12), 859–864 (1934).
Mykkeltveit J., Siu M.-K., Tong P.: On the cycle structure of some nonlinear shift register sequences. Inf. Control 43(2), 202–215 (1979).
Rubin A., Weiss G.: Mapping prefer-opposite to prefer-one de bruijn sequences. Des. Codes Crypt. 85, 547–555 (2017).
Solomon W.: Golomb. Shift Register Sequences. Holden-Day, San Francisco, California (1967).
Wang, X.F., Wong, D., Zhang, W.G.: A simple greedy de bruijn sequence construction. In: Sequences and Their Applications (SETA). (2018)
Acknowledgements
We would like to thank the two anonymous reviewers and the Associate Editor for the many valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by K.-U. Schmidt.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Jiang, Y. A relation between sequences generated by Golomb’s preference algorithm. Des. Codes Cryptogr. 91, 285–291 (2023). https://doi.org/10.1007/s10623-022-01108-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-022-01108-1