-
1
-
-
0024079392
-
Constructions for perfect maps and pseudo-random arrays
-
T. Etzion, “Constructions for perfect maps and pseudo-random arrays,” IEEE Trans. Inform. Theory, vol. IT-34, pp. 1308-1316, 1988.
-
(1988)
IEEE Trans. Inform. Theory
, vol.IT-34
, pp. 1308-1316
-
-
Etzion, T.1
-
2
-
-
0010909611
-
Note on the existence of Perfect Maps
-
I. S. Reed and R. M. Stewart, “Note on the existence of Perfect Maps,” IRE Trans. Inform. Theory, vol. IT-8, pp. 10-12, 1962.
-
(1962)
IRE Trans. Inform. Theory
, vol.IT-8
, pp. 10-12
-
-
Reed, I.S.1
Stewart, R.M.2
-
3
-
-
0011537850
-
Coding schemes for two-dimensional position sensing
-
J. Burns and C. J. Mitchell, “Coding schemes for two-dimensional position sensing,” in Cryptography and Coding III, M. Ganley, Ed. Oxford: Clarendan Press 1993.
-
(1993)
Cryptography and Coding III
-
-
Burns, J.1
Mitchell, C.J.2
-
4
-
-
0041781966
-
Graph Theory with Applications. New York: Elsevier, 1976
-
J. A. Bondy and U. S. R. Murty, “Graph Theory with Applications. New York: Elsevier, 1976.
-
(1976)
-
-
Bondy, J.A.1
Murty, U.S.R.2
-
5
-
-
0024681860
-
On the position measurement of automated guided vehicles using pseudorandom encoding
-
E. M. Petriu and J. S. Basran, “On the position measurement of automated guided vehicles using pseudorandom encoding,” IEEE Trans. Instrum. Meas., vol. 38, pp. 799-803, 1989.
-
(1989)
IEEE Trans. Instrum. Meas.
, vol.38
, pp. 799-803
-
-
Petriu, E.M.1
Basran, J.S.2
-
6
-
-
0025383717
-
Automated guided vehicle position recovery
-
E. M. Petriu, J. S. Basran, and F. C. A. Groen, “Automated guided vehicle position recovery,” IEEE Trans. Instrum. Meas., vol. 39, pp. 254-258, 1990.
-
(1990)
IEEE Trans. Instrum. Meas.
, vol.39
, pp. 254-258
-
-
Petriu, E.M.1
Basran, J.S.2
Groen, F.C.A.3
-
7
-
-
0021212476
-
Position recovery using binary sequences
-
B. Arazi, “Position recovery using binary sequences,” Electron. Lett., vol. 20, 61-62, 1984.
-
(1984)
Electron. Lett.
, vol.20
-
-
Arazi, B.1
-
8
-
-
0040264878
-
Decoding Perfect Maps
-
C. J. Mitchell and K. G. Paterson, “Decoding Perfect Maps,” Designs, Codes Cryptogr., vol. 4, no. 1 (1994) pp. 11-30.
-
(1994)
Designs
, vol.4
, Issue.1
, pp. 11-30
-
-
Mitchell, C.J.1
Paterson, K.G.2
-
10
-
-
0021483914
-
A note on binary arrays with a certain window property
-
S. L. Ma, “A note on binary arrays with a certain window property,” IEEE Trans. Inform. Theory, vol. IT-30, 774-775, 1984.
-
(1984)
IEEE Trans. Inform. Theory
, vol.IT-30
-
-
Ma, S.L.1
-
11
-
-
0000004039
-
On de Bruijn arrays
-
C. T. Fan, S. M. Fan, S. L. Ma, and M. K. Siu, “On de Bruijn arrays,” Ars Combinatoria, vol. 19A, pp. 205-213, 1985.
-
(1985)
Ars Combinatoria
, vol.19 A
, pp. 205-213
-
-
Fan, C.T.1
Fan, S.M.2
Ma, S.L.3
Siu, M.K.4
-
12
-
-
0000941884
-
On the complexities of de Bruijn sequences
-
A. H. Chan, R. A. Games, and E. L. Key, “On the complexities of de Bruijn sequences,” J. Comb. Theory, Ser. A, vol. 33, pp. 233-246, 1982.
-
(1982)
J. Comb. Theory
, vol.33
, pp. 233-246
-
-
Chan, A.H.1
Games, R.A.2
Key, E.L.3
-
13
-
-
0000869587
-
On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers
-
A. Lempel, “On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers,” IEEE Trans. Comput., vol. C-19, pp. 1204-1209, 1970.
-
(1970)
IEEE Trans. Comput.
, vol.C-19
, pp. 1204-1209
-
-
Lempel, A.1
-
14
-
-
0021483916
-
Construction of de Bruijn sequences of minimal complexity
-
T. Etzion and A. Lempel, “Construction of de Bruijn sequences of minimal complexity,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 705-709, 1984.
-
(1984)
IEEE Trans. Inform. Theory
, vol.IT-30
, pp. 705-709
-
-
Etzion, T.1
Lempel, A.2
-
16
-
-
0347260657
-
Construction of three-dimensional perfect matrices
-
A. M. Ivanyi, “Construction of three-dimensional perfect matrices,” Ars Combinatoria, vol. 29C, pp. 33-40, 1990.
-
(1990)
Ars Combinatoria
, vol.29 C
, pp. 33-40
-
-
Ivanyi, A.M.1
|