Complexity and sliding-block decodability
暂无分享,去创建一个
[1] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .
[2] Arvind M. Patel. Zero-modulation encoding in magnetic recording , 1975 .
[3] Brian H. Marcus,et al. Finite-State Modulation Codes for Data Storage , 2004 .
[4] Brian H. Marcus,et al. Sofic systems and encoding data , 1985, IEEE Trans. Inf. Theory.
[5] C. E. SHANNON,et al. A mathematical theory of communication , 1948, MOCO.
[6] Paul H. Siegel,et al. Correction to 'A note on the Shannon capacity of runlength-limited codes' (Jul 87 601-605) , 1993, IEEE Trans. Inf. Theory.
[7] Brian Marcus,et al. Factors and extensions of full shifts , 1979 .
[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[9] Paul H. Siegel,et al. A note on the Shannon capacity of run-length-limited codes , 1987, IEEE Trans. Inf. Theory.
[10] Brian H. Marcus,et al. Canonical Encoders for Sliding Block Decoders , 1995, SIAM J. Discret. Math..
[11] Brian H. Marcus,et al. Sliding-block coding for input-restricted channels , 1988, IEEE Trans. Inf. Theory.
[12] Don Coppersmith,et al. Algorithms for sliding block codes - An application of symbolic dynamics to information theory , 1983, IEEE Trans. Inf. Theory.
[13] P. Siegel,et al. A 100% Efficient Sliding-block Code For The Charge-constrained, Run-length-limited Channel With Parameters (d, k; c) - (1, 3; 3) , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.