Perfect maps
暂无分享,去创建一个
[1] Benjamin Arazi. Position recovery using binary sequences , 1984 .
[2] Richard A. Games,et al. A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.
[3] Siu Lun Ma. A note on binary arrays with a certain window property , 1984, IEEE Trans. Inf. Theory.
[4] Tuvi Etzion,et al. Constructions for perfect maps and pseudorandom arrays , 1988, IEEE Trans. Inf. Theory.
[5] Emil M. Petriu,et al. Automated guided vehicle position recovery , 1990 .
[6] Tuvi Etzion,et al. Construction of de Bruijn sequences of minimal complexity , 1984, IEEE Trans. Inf. Theory.
[7] Irving S. Reed,et al. Note on the existence of perfect maps , 1962, IRE Trans. Inf. Theory.
[8] Kenneth G. Paterson,et al. Decoding Perfect Maps , 1994, Des. Codes Cryptogr..
[9] Emil M. Petriu,et al. On the position measurement of automated guided vehicles using pseudorandom encoding , 1989 .
[10] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[11] Richard A. Games,et al. On the Complexities of de Bruijn Sequences , 1982, J. Comb. Theory, Ser. A.
[12] 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.