Perfect factors from cyclic codes and interleaving

被引：1

作者：

Mitchell, CJ ^{[1
]}

Paterson, KG

机构：

[1] Univ London, Royal Holloway & Bedford New Coll, Dept Comp Sci, Egham TW20 0EX, Surrey, England

[2] Hewlett Packard Labs, Bristol BS12 6QZ, Avon, England

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 1998年 / 11卷 / 02期

关键词：

de Bruijn sequence; de Bruijn graph; window sequence; Perfect Factor; cyclic code; Lempel homomorphism; interleaving;

D O I：

10.1137/S089548019630649X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this paper, we introduce new construction methods for Perfect Factors. These are based on the theory of cyclic codes, interleaving techniques and the Lempel homomorphism. The constructions enable us to settle the existence question for Perfect Factors for window sizes at most six.

引用

页码：241 / 264

页数：24

共 14 条

[1] CONSTRUCTIONS FOR PERFECT MAPS AND PSEUDORANDOM ARRAYS [J].

ETZION, T .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (05) :1308-1316

[2] A SURVEY OF FULL LENGTH NON-LINEAR SHIFT REGISTER CYCLE ALGORITHMS [J].

FREDRICKSEN, H .

SIAM REVIEW, 1982, 24 (02) :195-221

[3] ON THE DEBRUIJN TORUS PROBLEM [J].

HURLBERT, G ;

ISAAK, G .

JOURNAL OF COMBINATORIAL THEORY SERIES A, 1993, 64 (01) :50-62

[4]

Lempel A., 1970, IEEE Transactions on Computers, VC-19, P1204, DOI 10.1109/T-C.1970.222859

[5]

LIDL R, 1986, INTRO FINITE FIELD T

[6]

Mac Williams F., 1977, THEORY ERROR CORRECT

[7]

MITCHELL C, 1995, CODES CYPHERS, P299

[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] de Bruijn sequences and perfect factors [J].

Mitchell, CJ .

SIAM JOURNAL ON DISCRETE MATHEMATICS, 1997, 10 (02) :270-281

← 1 2 →