Perfect Maps

IEEE Transactions on Information Theory

Volumn 40, Issue 3, 1994, Pages 743-753

  Paterson, Kenneth G ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

de Bruijn array; linear complexity; Perfect Maps; window property

Indexed keywords

ARRAYS; BINARY SEQUENCES; COMPUTATIONAL COMPLEXITY; INFORMATION THEORY; MATHEMATICAL MODELS;

DE BRUIJN ARRAY; LINEAR COMPLEXITY; PERFECT MAPS; WINDOW PROPERTY;

NUMBER THEORY;

EID: 0028425151     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.335886     Document Type: Article

References (16)

1. T. Etzion, “Constructions for perfect maps and pseudo-random arrays,” IEEE Trans. Inform. Theory, vol. IT-34, pp. 1308-1316, 1988.
2. 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.
3. 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.
4. J. A. Bondy and U. S. R. Murty, “Graph Theory with Applications. New York: Elsevier, 1976.
5. 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.
6. 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.
7. B. Arazi, “Position recovery using binary sequences,” Electron. Lett., vol. 20, 61-62, 1984.
8. C. J. Mitchell and K. G. Paterson, “Decoding Perfect Maps,” Designs, Codes Cryptogr., vol. 4, no. 1 (1994) pp. 11-30.
9. N. G. de Bruijn, “A combinatorial problem,” in Proc. Nederlanske Akademie van Wetenschappen, vol. 49, pp. 758-764, 1946.
10. S. L. Ma, “A note on binary arrays with a certain window property,” IEEE Trans. Inform. Theory, vol. IT-30, 774-775, 1984.
11. 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.
12. 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.
13. 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.
14. T. Etzion and A. Lempel, “Construction of de Bruijn sequences of minimal complexity,” IEEE Trans. Inform. Theory, vol. IT-30, pp. 705-709, 1984.
15. R. A. Games and A. H. Chan, “A fast algorithm for determining the complexity of a binary sequence with period 2",” IEEE Trans. Inform. Theory, vol. IT-29, pp. 144-146, 1983.
16. A. M. Ivanyi, “Construction of three-dimensional perfect matrices,” Ars Combinatoria, vol. 29C, pp. 33-40, 1990.