Capacity Bounds for the 3-Dimensional (0, 1) Runlength Limited Channel
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Communication on Inductively Coupled Channels: Overview and Challenges
ICMCTA '08 Proceedings of the 2nd international Castle meeting on Coding Theory and Applications
Capacity bounds for two-dimensional asymmetric M-ary (0, k) and (d,∞) runlength-limited channels
IEEE Transactions on Communications
Enumerative maximum-transition-run codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Coding for a bit-shift channel with applications to inductively coupled channels
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Performance evaluation of the probe storage channel
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
DC-free turbo coding scheme using MAP/SOVA algorithms
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Enumeration of constant-weight run-length limited binary sequences
Problems of Information Transmission
| Hi-index | 754.84 |
Constrained codes are a key component in digital recording devices that have become ubiquitous in computer data storage and electronic entertainment applications. This paper surveys the theory and practice of constrained coding, tracing the evolution of the subject from its origins in Shannon's classic 1948 paper to present-day applications in high-density digital recorders. Open problems and future research directions are also addressed