High-Rate Maximum Runlength Constrained Coding Schemes Using Nibble Replacement
暂无分享,去创建一个
[1] Kees A. Schouhamer Immink. High-rate maximum runlength constrained coding schemes using base conversion , 2010, 2010 International Symposium On Information Theory & Its Applications.
[2] Yang Han,et al. Concatenating a Structured LDPC Code and a Constrained Code to Preserve Soft-Decoding, Structure, and Burst Correction , 2006, IEEE Transactions on Magnetics.
[3] William H. Kautz. Ieee Transactions on Information Theory Co~tcluding Remarks , 2022 .
[4] A. Wijngaarden,et al. SIMPLE HIGH-RATE CONSTRAINED CODES , 1996 .
[5] Brian H. Marcus,et al. Tradeoff functions for constrained systems with unconstrained positions , 2004, IEEE Transactions on Information Theory.
[6] Paul H. Siegel,et al. Codes for Mass Data Storage Systems (Second , .
[7] Adriaan J. de Lind van Wijngaarden,et al. Construction of Maximum Run-Length Limited Codes Using Sequence Replacement Techniques , 2010, IEEE Journal on Selected Areas in Communications.
[8] Schouhamer Immink,et al. Codes for mass data storage systems , 2004 .
[9] Kees A. Schouhamer Immink,et al. Error propagation assessment of enumerative coding schemes , 1999, IEEE Trans. Inf. Theory.
[10] Paul Siegel,et al. Codes for Mass Data Storage Systems (Second Edition) (K. H. Schouhamer Immink; 2004) [Book review] , 2006, IEEE Transactions on Information Theory.
[11] Kees A. Schouhamer Immink. A practical method for approaching the channel capacity of constrained channels , 1997, IEEE Trans. Inf. Theory.