Zero capacity region of multidimensional run length constraints
暂无分享,去创建一个
[1] A. D. Keedwell,et al. Latin Squares: New Developments in the Theory and Applications , 1991 .
[2] J. Wolf,et al. Bit-stuffing bounds on the capacity of 2-dimensional constrained arrays , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[3] Paul H. Siegel,et al. Codes for Digital Recorders , 1998, IEEE Trans. Inf. Theory.
[4] Kenneth Zeger,et al. Capacity bounds for the three-dimensional (0, 1) run length limited channel , 2000, IEEE Trans. Inf. Theory.
[5] Douglas Lind,et al. An Introduction to Symbolic Dynamics and Coding , 1995 .
[6] Kenneth Zeger,et al. Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel , 1999, AAECC.
[7] Kenneth Zeger,et al. On the capacity of two-dimensional run-length constrained channels , 1999, IEEE Trans. Inf. Theory.
[8] Kenneth Zeger,et al. Zero Capacity Region of Multidimensional Run Length Constraints , 1999 .
[9] Paul H. Siegel,et al. Efficient coding schemes for the hard-square model , 2001, IEEE Trans. Inf. Theory.
[10] Herbert S. Wilf,et al. The Number of Independent Sets in a Grid Graph , 1998, SIAM J. Discret. Math..
[11] Paul H. Siegel,et al. A note on the Shannon capacity of run-length-limited codes , 1987, IEEE Trans. Inf. Theory.