Generating De Bruijn Sequences: An Efficient Implementation

  • Authors:
  • F. S. Annexstein

  • Affiliations:
  • Univ. of Cincinnati, Cinncinnati, OH

  • Venue:
  • IEEE Transactions on Computers
  • Year:
  • 1997

Quantified Score

Hi-index 15.04

Visualization

Abstract

This paper presents a concise and efficient implementation of a method of producing De Bruijn sequences. The implementation is based on a recursive method due to Lempel [5]. We provide code for a function that for each pair of integers n驴 2 and 0 驴x