Almost-Certainly Runlength-Limiting Codes
Proceedings of the 8th IMA International Conference on Cryptography and Coding
On row-by-row coding for 2-D constraints
IEEE Transactions on Information Theory
Enumerative maximum-transition-run codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
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
Approximate enumerative coding for 2-D constraints through ratios of matrix products
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Construction of maximum run-length limited codes using sequence replacement techniques
IEEE Journal on Selected Areas in Communications
Weakly-constrained codes for suppression of patterning effects in digital communications
IEEE Transactions on Communications
DC-free turbo coding scheme using MAP/SOVA algorithms
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
| Hi-index | 754.90 |
A new coding technique is proposed that translates user information into a constrained sequence using very long codewords. Huge error propagation resulting from the use of long codewords is avoided by reversing the conventional hierarchy of the error control code and the constrained code. The new technique is exemplified by focusing on (d, k)-constrained codes. A storage-effective enumerative encoding scheme is proposed for translating user data into long dk sequences and vice versa. For dk runlength-limited codes, estimates are given of the relationship between coding efficiency versus encoder and decoder complexity. We show that for most common d, k values, a code rate of less than 0.5% below channel capacity can be obtained by using hardware mainly consisting of a ROM lookup table of size 1 kbyte. For selected values of d and k, the size of the lookup table is much smaller. The paper is concluded by an illustrative numerical example of a rate 256/466, (d=2, k=15) code, which provides a serviceable 10% increase in rate with respect to its traditional rate 1/2, (2, 7) counterpart