Abstract
In this paper, we consider the adjacency graphs of some feedback shift registers (FSRs), namely, the FSRs with characteristic functions of the form \(g=(x_0+x_1)*f\). Firstly, we give some properties about these FSRs. We prove that these FSRs generate only prime cycles, and these cycles can be divided into two sets such that each set contains no adjacent cycles. When f is a linear function, more properties about these FSRs are derived. For example, it is shown that, when f contains an odd number of terms, the adjacency graph of \({\mathrm {FSR}}((x_0+x_1)*f)\) can be determined directly from the adjacency graph of \({\mathrm {FSR}}(f)\). Then, as an application of these results, we continue the work of Li et al. (IEEE Trans Inf Theory 60(5):3052–3061, 2014) to determine the adjacency graphs of \({\mathrm {FSR}}((1+x)^4p(x))\) and \({\mathrm {FSR}}((1+x)^5p(x))\), where p(x) is a primitive polynomial, and construct a large class of De Bruijn sequences from them.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
de Bruijn N.G.: A combinatorial problem. Proc. Kon. Ned. Akad. Wet. 49, 746–758 (1946).
Etzion T., Lempel A.: Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inf. Theory 30(3), 480–484 (1984).
Fredricksen H.: A class of nonlinear de Bruijn cycles. J. Comb. Theory Ser. A 19(2), 192–199 (1975).
Fredricksen H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195–221 (1982).
Golomb S.W.: Shift Register Sequences. Holden-Day, San Francisco (1967).
Green D.H., Dimond K.R.: Nonlinear product-feedback shift registers. Proc. IEE 117(4), 681–686 (1970).
Hauge E.R., Mykkeltveit J.: On the classification of deBruijn sequences. Discret. Math. 148(1), 65–83 (1996).
Hemmati F.: A large class of nonlinear shift register sequences. IEEE Trans. Inf. Theory 28(2), 355–359 (1982).
Jansen C.J.A., Franx W.G., Boekee D.E.: An efficient algorithm for the generation of deBruijn cycles. IEEE Trans. Inf. Theory 37(5), 1475–1478 (1991).
Lempel A.: On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers. IEEE Trans. Comput. 19(12), 1204–1209 (1970).
Li C.Y., Zeng X.Y., Helleseth T., Li C.L., Hu L.: The properties of a class of linear FSRs and their applications to the construction of nonlinear FSRs. IEEE Trans. Inf. Theory 60(5), 3052–3061 (2014).
Li C.Y., Zeng X.Y., Li C.Y., Zeng X.Y., Li C.L., Helleseth T.: A class of de Bruijn sequences. IEEE Trans. Inf. Theory 60(12), 7955–7969 (2014).
Li C.Y., Zeng X.Y., Li C.L., Helleseth T., Li M.: Construction of de Bruijn sequences from LFSRs with reducible characteristic polynomials. IEEE Trans. Inf. Theory 62(1), 610–624 (2016).
Magleby K.B.: The Synthesis of Nonlinear Feedback Shift Registers. Tech. Rep. 6207–1. Stanford Electronic Labs, Stanford (1963).
Mykkeltveit J., Szmidt J.: On cross joining de Bruijn sequences. Contemp. Math. 632, 333–344 (2015).
Mykkeltveit J., Siu M.K., Tong P.: On the cycle structure of some nonlinear shift register sequences. Inf. Control 43(2), 202–215 (1979).
Tian T., Qi W.F.: On the largest affine sub-families of a family of NFSR sequences. Des. Codes Cryptogr. 71(1), 163–181 (2014).
Zierler N.: Linear recurring sequences. J. Soc. Ind. Appl. Math. 7(1), 31–48 (1959).
Acknowledgments
This work was supported by the National Science Foundation of China (Grant Nos. 61379139, 11526215 and 61502483) and the Strategic Priority Research Program of the Chinese Academy of Sciences (Grant No. XDA06010701).
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by K. T. Arasu.
Rights and permissions
About this article
Cite this article
Li, M., Jiang, Y. & Lin, D. The adjacency graphs of some feedback shift registers. Des. Codes Cryptogr. 82, 695–713 (2017). https://doi.org/10.1007/s10623-016-0187-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-016-0187-6