IEEE Transactions on Information Theory
On row-by-row coding for 2-D constraints
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
The zeta function of a periodic-finite-type shift
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
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 | 754.96 |
We develop methods for analyzing and constructing combined modulation/error-correcting codes (ECC codes), in particular codes that employ some form of reversed concatenation and whose ECC decoding scheme requires easy access to soft information (e.g., turbo codes, low-density parity-check (LDPC) codes or parity codes). We expand on earlier work of Wijngaarden and Immink (1998, 2001), Immink (1999) and Fan (1999), in which certain bit positions are reserved for ECC parity, in the sense that the bit values in these positions can be changed without violating the constraint. Earlier work has focused more on block codes for specific modulation constraints. While our treatment is completely general, we focus on finite-state codes for maximum transition run (MTR) constraints. We (1) obtain some improved constructions for MTR codes based on short block lengths, (2) specify an asymptotic lower bound for MTR constraints, which is tight in very special cases, for the maximal code rate achievable for an MTR code with a given density of unconstrained positions, and (3) show how to compute the capacity of the set of sequences that satisfy a completely arbitrary constraint with a specified set of bit positions unconstrained