de Bruijn sequences and perfect factors

被引：2
作者：
Mitchell, CJ
机构：
[1] Information Security Group, Royal Holloway, University of London, Egham
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 1997年 / 10卷 / 02期
关键词：
de Bruijn sequence; de Bruijn graph; window sequence; Perfect Factor;
D O I：
10.1137/S0895480195290911
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper we describe new constructions for de Bruijn sequences and Perfect Factors. These constructions are all based upon the idea of constructing one sequence (or set of sequences) from another. As a result of this fact, the sequences obtained from these construction methods possess simple decoding algorithms based on decoding the sequences used to construct them. Such decoding algorithms are of importance in position-location applications.
引用
收藏
页码：270 / 281
页数：12
相关论文
共 15 条
[1]  
BLACKBURN S, IN PRESS J COMBIN A
[2]  
BONDY JA, 1976, GRAPH THEORY APPLICA
[3]  
BURNS J, 1993, CRYPTOGRAPHY CODING, V3, P31
[4]   CONSTRUCTIONS FOR PERFECT MAPS AND PSEUDORANDOM ARRAYS [J].
ETZION, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1308-1316
[5]  
Lempel A., 1970, IEEE Transactions on Computers, VC-19, P1204, DOI 10.1109/T-C.1970.222859
[6]  
MITCHELL C, 1995, CODES CYPHERS, P299
[7]  
MITCHELL C, 1993, P 4 IMA C CRYPT COD
[8]  
Mitchell C. J., 1994, Designs, Codes and Cryptography, V4, P341, DOI 10.1007/BF01388650
[9]  
Mitchell C. J., 1994, Designs, Codes and Cryptography, V4, P11, DOI 10.1007/BF01388557
[10]   A method for constructing decodable de Bruijn sequences [J].
Mitchell, CJ ;
Etzion, T ;
Paterson, KG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (05) :1472-1478
12