An Efficient Implementation F.S. Annexstein  Home/Search
Context
Related
| uc.edu/~annexste/P...nGeneratingDB.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uc.edu/~annexste/Papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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 returns a unique De Bruijn sequence of order-n. The implementation requires only O(2 ) bit operations Index Terms---Shift register sequences, De Bruijn graphs, computational complexity, recursive algorithms, NESL programming language. (Update)
Active bibliography (related documents): More All
0.6: An Efficient Implementation of the D-Homomorphism for.. - Chang, Park, Kim, Song (1999) (Correct)
0.1: A Method for Constructing Decodable de Bruijn Sequences - Mitchell, Etzion, Paterson (1996) (Correct)
0.1: Construction of de Bruijn Sequences of Minimal Complexity - Etzion, Lempel (1984) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ implementation-generating,
author = "An Efficient Implementation",
title = "Generating De Bruijn Sequences:",
url = "citeseer.ist.psu.edu/745540.html" }
Citations (may not include all citations):182 Algebraic Coding Theory (context) - Berlekamp - 1984
170 Shift Register Sequences (context) - Golomb - 1967
166 NESL: A Nested Data-Parallel Language - Blelloch - 1994
8 a Homomorphism of the De Bruijn Graph and Its Applications t.. (context) - Lempel - 1970
2 A Survey of Full Cycle Algorithms (context) - Fredrickson - 1982
Documents on the same site (http://www.ececs.uc.edu/~annexste/Papers/): More
Ranking Algorithms For Hamiltonian Paths In Hypercubic Networks - Annexstein (Correct)
Latency Effects on Reachability in Large-scale Peer-to-Peer.. - Annexstein, al. (2001) (Correct)
Latency Effects on Reachability in Large-scale Peer-to-Peer.. - Annexstein, al. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC