论文信息 - Perfect Factors from Cyclic Codes and Interleaving

Perfect Factors from Cyclic Codes and Interleaving

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.

Kenneth G. Paterson | Chris J. Mitchell

[1] Chris J. Mitchell. De Bruijn Sequences and Perfect Factors , 1997, SIAM J. Discret. Math..

[2] Kenneth G. Paterson,et al. Decoding Perfect Maps , 1994, Des. Codes Cryptogr..

[3] Chris J. Mitchell. Constructingc-ary Perfect Factors , 1994, Des. Codes Cryptogr..

[4] Abraham Lempel,et al. On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers , 1970, IEEE Transactions on Computers.

[5] F. MacWilliams,et al. The Theory of Error-Correcting Codes , 1977 .

[6] Tuvi Etzion,et al. Constructions for perfect maps and pseudorandom arrays , 1988, IEEE Trans. Inf. Theory.

[7] Harald Niederreiter,et al. Introduction to finite fields and their applications: List of Symbols , 1986 .

[8] Kenneth G. Paterson. Perfect maps , 1994, IEEE Trans. Inf. Theory.

[9] Glenn H. Hurlbert,et al. On the de Bruijn Torus Problem , 1993, J. Comb. Theory, Ser. A.

[10] Kenneth G. Paterson,et al. New Classes of Perfect Maps I , 1996, J. Comb. Theory, Ser. A.

[11] H. Fredricksen. A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .

[12] Kenneth G. Paterson. Perfect factors in the de Bruijn graph , 1995, Des. Codes Cryptogr..