论文信息 - Construction of Capacity Achieving $(M, d, \infty)$ Constrained Codes With Least Decoder Window Length - 字舞流文

Construction of Capacity Achieving $(M, d, \infty)$ Constrained Codes With Least Decoder Window Length

We present capacity achieving multilevel run-length-limited (ML-RLL) codes that can be decoded by a sliding window of size 2.

Kees A. Schouhamer Immink | Ashwin Kumar | Ashwin Kumar

[1] Jian Luo,et al. On the capacity of M-ary runlength-limited codes , 1995, IEEE Trans. Inf. Theory.

[2] Steven W. McLaughlin,et al. Five runlength-limited codes for M-ary recording channels , 1997 .

[3] Schouhamer Immink,et al. Codes for mass data storage systems , 2004 .

[4] M. J. Gans,et al. On Limits of Wireless Communications in a Fading Environment when Using Multiple Antennas , 1998, Wirel. Pers. Commun..

[5] S. Verdu,et al. Multiple-access channels with memory with and without frame synchronism , 1989, IEEE Trans. Inf. Theory.

[6] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .

[7] Elza Erkip,et al. On beamforming with finite rate feedback in multiple-antenna systems , 2003, IEEE Trans. Inf. Theory.

[8] Joseph M. Kahn,et al. Fading correlation and its effect on the capacity of multielement antenna systems , 2000, IEEE Trans. Commun..

[9] Robert W. Heath,et al. Grassmannian beamforming for multiple-input multiple-output wireless systems , 2003, IEEE Trans. Inf. Theory.

[10] Steven W. McLaughlin. The construction of M-ary (d, {infty}) codes that achieve capacity and have the fewest number of encoder states , 1997, IEEE Trans. Inf. Theory.