Skip to main content
SpringerLink
Log in

On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs

  • Conference paper
  • First Online:
Mathematics and Computing (ICMC 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 834))

Included in the following conference series:

  • 608 Accesses

Abstract

An n-th order k-ary de Bruijn sequence is a cyclic sequence of length \(k^{n}\) which contains every possible k-ary subsequence of length n exactly once during each period. In this paper, we show that, if we fix the initial n bits, any n-th order de Bruijn sequence can be transformed to another using a sequence of transformations.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Annexstein, F.S.: Generating de Bruijn sequences: an efficient implementation. IEEE Trans. Comput. 46(2), 198–200 (1997)

    Article  Google Scholar 

  2. Bidkhori, H., Kishore, S.: A bijective proof of a theorem of Knuth. Comb. Probab. Comput. 20(1), 11–25 (2011)

    Article  MathSciNet  Google Scholar 

  3. De Bruijn, N.G.: A Combinatorial Problem. Koninklijke Nederlandsche Akademie Van Wetenschappen, vol. 49, no. 6, pp. 758–764, June 1946

    Google Scholar 

  4. Etzion, T., Lempel, A.: Algorithms for the generation of full-length shift-register sequences. IEEE Trans. Inf. Theory 30(3), 480–484 (1984)

    Article  MathSciNet  Google Scholar 

  5. Fredricksen, H.: A survey of full length nonlinear shift register cycle algorithms. SIAM Rev. 24(2), 195–221 (1982)

    Article  MathSciNet  Google Scholar 

  6. Fredricksen, H.M.: Disjoint cycles from the de Bruijn graph. Technical report, DTIC Document (1968)

    Google Scholar 

  7. Golomb, S.W., et al.: Shift Register Sequences. Aegean Park Press, Laguna Hills (1982)

    MATH  Google Scholar 

  8. Jansen, C.J.A.: Investigations on nonlinear streamcipher systems: construction and evaluation methods. Ph.D. thesis, Technische Universiteit Delft (1989)

    Google Scholar 

  9. Lempel, A.: On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers. IEEE Trans. Comput. 100(12), 1204–1209 (1970)

    Article  MathSciNet  Google Scholar 

  10. Mykkeltveit, J., Szmidt, J.: On cross joining de Bruijn sequences. In: Topics in Finite Fields, vol. 632, pp. 335–346 (2015)

    Google Scholar 

  11. Schneier, B.: Applied Cryptography: Protocols, Algorithms, and Source Code in C. Wiley, New York (2007)

    MATH  Google Scholar 

  12. Spinsante, S., Andrenacci, S., Gambi, E.: De Bruijn sequences for spread spectrum applications: analysis and results. In: 18th International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2010, pp. 365–369, September 2010

    Google Scholar 

Download references

Acknowledgment

The authors are grateful to Prof. Harish K. Pillai, Department of Electrical Engineering, Indian Institute of Technology Bombay, without whom this work would never have been possible.

Author information

Authors and Affiliations

  1. Department of Electronics and Electrical Engineering, Indian Institute of Technology Guwahati, Guwahati, 781039, Assam, India

    Suman Roy & Srinivasan Krishnaswamy

  2. Bharat Broadband Network Limited, Trivandrum, India

    P. Vinod Kumar

Authors
  1. Suman Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Srinivasan Krishnaswamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. P. Vinod Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Suman Roy .

Editor information

Editors and Affiliations

  1. Department of Mathematical Sciences, Indian Institute of Technology BHU, Varanasi, Uttar Pradesh, India

    Debdas Ghosh

  2. Haldia Institute of Technology, Haldia, India

    Debasis Giri

  3. University of Central Florida, Orlando, Florida, USA

    Ram N. Mohapatra

  4. Istanbul Commerce University, Istanbul, Turkey

    Ekrem Savas

  5. Kyushu University, Fukuoka, Japan

    Kouichi Sakurai

  6. Indian Institute of Technology (BHU), Varanasi, India

    L. P. Singh

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Roy, S., Krishnaswamy, S., Vinod Kumar, P. (2018). On Leaf Node Edge Switchings in Spanning Trees of De Bruijn Graphs. In: Ghosh, D., Giri, D., Mohapatra, R., Savas, E., Sakurai, K., Singh, L. (eds) Mathematics and Computing. ICMC 2018. Communications in Computer and Information Science, vol 834. Springer, Singapore. https://doi.org/10.1007/978-981-13-0023-3_11

Download citation

  • DOI: https://doi.org/10.1007/978-981-13-0023-3_11

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-13-0022-6

  • Online ISBN: 978-981-13-0023-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation