Decoding Perfect Maps-Reference-Cited by-同舟云学术

Decoding Perfect Maps

Published:1994-01 Issue:1 Volume:4 Page:11-30
ISSN:0925-1022
Container-title:Designs, Codes and Cryptography
language:en
Short-container-title:Des Codes Crypt

Author:

Mitchell Chris J.,Paterson Kenneth G.

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/BF01388557/fulltext.html

Reference24 articles.

1. Arazi, B. 1984. Position recovery using binary sequences.Electronics Letters. 20:61?62.

2. Bondy, J.A. and Murty, U.S.R. 1976.Graph Theory with Applications. Elsevier.

3. Burns, J. and Mitchell, C.J. Coding schemes for two-dimensional position sensing. In M. Ganley, ed.Cryptography and Coding III. Oxford University Press (to appear).

4. de Bruijn, N.G. 1946. A combinatorial problem.Proceedings Nederlandse Akademie van Wetenschappen. 49:758?764.

5. Dénes, J. and Keedwell, A.D. 1990. A new construction of two-dimensional arrays with the window property.IEEE Transactions on Information Theory. 36:873?876.

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Two-dimensional applications;Sequences and the de Bruijn Graph;2024

2. Two-dimensional arrays;Sequences and the de Bruijn Graph;2024

3. Perfect Bit Fields and Their Technical Application;2022 20th International Conference on Mechatronics - Mechatronika (ME);2022-12-07

4. M-Array Based on Non-Zero Maps;IEEE Access;2021

5. On a Construction of Easily Decodable Sub-de Bruijn Arrays;Journal of Applied and Industrial Mathematics;2019-04