DocumentCode :
1318500
Title :
A method for constructing decodable de Bruijn sequences
Author :
Mitchell, Chris J. ; Etzion, Tuvi ; Paterson, Kenneth G.
Author_Institution :
Dept. of Comput. Sci., London Univ., UK
Volume :
42
Issue :
5
fYear :
1996
fDate :
9/1/1996 12:00:00 AM
Firstpage :
1472
Lastpage :
1478
Abstract :
We present two related methods of construction for de Bruijn (1946) sequences, both based on interleaving “smaller” de Bruijn sequences. Sequences obtained using these construction methods have the advantage that they can be “decoded” very efficiently, i.e., the position within the sequence of any particular “window” can be found very simply. Sequences with simple decoding algorithms are of considerable practical importance in position location applications
Keywords :
decoding; sequences; construction methods; de Bruijn sequences interleaving; decodable de Bruijn sequences; decoding algorithms; position location applications; window sequences; Computational complexity; Computer science; Decoding; Interleaved codes; Linear feedback shift registers; Mathematics; Polynomials; Shift registers; State feedback; Table lookup;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/18.532887
Filename :
532887
Link To Document :
بازگشت