Coding Schemes for Two-Dimensional Position Sensing
暂无分享,去创建一个
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] Emil M. Petriu,et al. On the position measurement of automated guided vehicles using pseudorandom encoding , 1989 .
[3] H. Fredricksen. A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .
[4] Ranan B. Banerji. The Construction of Binary Matrices with Distinct Submatrices , 1978, IEEE Transactions on Computers.
[5] Anthony Ralston. A New Memoryless Algorithm for De Bruijn Sequences , 1981, J. Algorithms.
[6] Meghanad D. Wagh,et al. On Construction of Matrices with Distinct Submatrices , 1980, SIAM J. Matrix Anal. Appl..
[7] E. M. Petriu. New pseudorandom/natural code conversion method , 1988 .
[8] Harold Fredricksen,et al. Lexicographic Compositions and deBruijn Sequences , 1977, J. Comb. Theory, Ser. A.
[9] Antal Iványi. Construction of infinite de Bruijn arrays , 1989, Discret. Appl. Math..
[10] I. Good. Normal Recurring Decimals , 1946 .
[11] Emile Roth. Permutations Arranged Around a Circle , 1971 .
[12] Tuvi Etzion,et al. On the distribution of de Bruijn sequences of given complexity , 1984, IEEE Trans. Inf. Theory.
[13] Tuvi Etzion,et al. Constructions for perfect maps and pseudorandom arrays , 1988, IEEE Trans. Inf. Theory.
[14] Solomon W. Golomb,et al. Linear spans of modified de Bruijn sequences , 1990, IEEE Trans. Inf. Theory.
[15] Tuvi Etzion,et al. Algorithms for the generation of full-length shift-register sequences , 1984, IEEE Trans. Inf. Theory.
[16] E. M. Petriu. Scanning method for absolute pseudorandom position encoders , 1988 .
[17] Benjamin Arazi. Position recovery using binary sequences , 1984 .
[18] Tuvi Etzion. An Algorithm for Constructing m-ary de Bruijn Sequences , 1986, J. Algorithms.
[19] F. MacWilliams,et al. Pseudo-random sequences and arrays , 1976, Proceedings of the IEEE.
[20] Akira Fukuda,et al. A theory of two-dimensional linear recurring arrays , 1972, IEEE Trans. Inf. Theory.
[21] Emil M. Petriu. Absolute-type position transducers using a pseudorandom encoding , 1987, IEEE Transactions on Instrumentation and Measurement.
[22] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[23] Tuvi Etzion,et al. Construction of de Bruijn sequences of minimal complexity , 1984, IEEE Trans. Inf. Theory.
[24] Richard A. Games,et al. On the Complexities of de Bruijn Sequences , 1982, J. Comb. Theory, Ser. A.
[25] Irving S. Reed,et al. Note on the existence of perfect maps , 1962, IRE Trans. Inf. Theory.
[26] Harold Fredricksen,et al. A Class of Nonlinear de Bruijn Cycles , 1975, J. Comb. Theory, Ser. A.
[27] T. Etzion. On pseudo-random arrays constructed from patterns with distinct differences , 1990 .
[28] Harold Fredricksen,et al. Necklaces of beads in k colors and k-ary de Bruijn sequences , 1978, Discret. Math..
[29] 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.
[30] Siu Lun Ma. A note on binary arrays with a certain window property , 1984, IEEE Trans. Inf. Theory.
[31] Tuvi Etzion. On the distribution of de Bruijn CR-sequences , 1986, IEEE Trans. Inf. Theory.
[32] A. Donald Keedwell,et al. A new construction of two-dimensional arrays with the window property , 1990, IEEE Trans. Inf. Theory.
[33] Richard A. Games,et al. On the quadratic spans of DeBruijn sequences , 1990, IEEE Trans. Inf. Theory.
[34] Emil M. Petriu,et al. Automated guided vehicle position recovery , 1990 .
[35] E. Petriu. Absolute-type pseudorandom shaft encoder with any desired resolution , 1985 .
[36] B. Gordon. On the existence of perfect maps (Corresp.) , 1966, IEEE Trans. Inf. Theory.
[37] D. H. Green. Structural properties of pseudorandom arrays and volumes and their related sequences , 1985 .
[38] Sheelagh Lloyd,et al. Finding the Position of a Subarray in a Pseudo-random Array , 1991 .
[39] Tuvi Etzion. An Algorithm for Generating Shift-Register Cycles , 1986, Theor. Comput. Sci..
[40] N. Gaffke,et al. Note on a paper , 1991 .