Scaling tape-recording areal densities to 100 Gb/in 2
IBM Journal of Research and Development
IEEE Transactions on Information Theory
Insertion rate and optimization of redundancy of constrained systems with unconstrained positions
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Construction of maximum run-length limited codes using sequence replacement techniques
IEEE Journal on Selected Areas in Communications
Distance-enhancing constrained codes with parity-check constraints for data storage channels
IEEE Journal on Selected Areas in Communications
The Tradeoff Function for a Class of $\mathrm{RLL}(d,k)$ Constraints
SIAM Journal on Discrete Mathematics
Independence entropy of Z^d-shift spaces
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
| Hi-index | 0.13 |
New methods are presented to protect maximum runlength-limited sequences against random and burst errors and to avoid error propagation. The methods employ parallel conversion techniques and enumerative coding algorithms that transform binary user information into constrained codewords. The new schemes have a low complexity and are very efficient. The approach can be used for modulation coding in recording systems and for synchronization and line coding in communication systems. The schemes enable the usage of high-rate constrained codes, as error control can be provided with similar capabilities as for unconstrained sequences