Difference-preserving codes
暂无分享,去创建一个
[1] Robert J. Douglas,et al. Upper bounds on the length of circuits of even spread in the d-cube , 1969 .
[2] Victor Klee,et al. A Method for Constructing Circuit Codes , 1967, JACM.
[3] Victor Klee,et al. What is the Maximum Length of a d-Dimensional Snake? , 1970 .
[4] William H. Kautz,et al. Unit-Distance Error-Checking Codes , 1958, IRE Trans. Electron. Comput..
[5] Aaron D. Wyner. Note on Circuits and Chains of Spread k in the n-Cube , 1971, IEEE Transactions on Computers.
[6] Robert J. Douglas,et al. Some results on the maximum length of circuits of spread k in the d-cube* , 1969 .
[7] James L. Massey,et al. Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972) , 1973, IEEE Trans. Inf. Theory.
[8] Richard C. Singleton,et al. Generalized Snake-in-the-Box Codes , 1966, IEEE Trans. Electron. Comput..
[9] Victor Klee,et al. Lengths of snakes in boxes , 1967 .
[10] R. Gallager. Information Theory and Reliable Communication , 1968 .
[11] I. M. Jacobs,et al. Principles of Communication Engineering , 1965 .
[12] Donald W. Davies,et al. Longest "Separated" Paths and Loops in an N Cube , 1965, IEEE Trans. Electron. Comput..