Maximum runlength-limited codes with error control capabilities

Wijngaarden, A.J. van; Immink, Kees A. Schouhamer

doi:10.1109/49.920169

Cited by 48 publications

(24 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In a recent paper [8], such codes have been proposed. They are free from induced burst errors, amenable to an efficient hardware implementation, and can accommodate any external FEC code (which consequently does not have to be burst-correcting).…”

Section: Discussionmentioning

confidence: 99%

Reduction of nonlinear intrachannel effects by channel asymmetry in transmission lines with strong bit overlapping

Shapiro

Федорук

Turitsyn

et al. 2003

IEEE Photon. Technol. Lett.

View full text Add to dashboard Cite

Abstract-We have examined the statistics of simulated bit-error rates in optical transmission systems with strong patterning effects and have found strong correlation between the probability of marks in a pseudorandom pattern and the error-free transmission distance. We discuss how a reduced density of marks can be achieved by preencoding optical data.Index Terms-Forward-error correction (FEC), numerical analysis, optical fiber communication, run length codes.

show abstract

Section: Discussionmentioning

confidence: 99%

Reduction of nonlinear intrachannel effects by channel asymmetry in transmission lines with strong bit overlapping

Shapiro

Федорук

Turitsyn

et al. 2003

IEEE Photon. Technol. Lett.

View full text Add to dashboard Cite

show abstract

“…Wijngaarden and Immink proposed a coding scheme for the reverse concatenation system [3]. Campello et al analyzed the system in detail [4].…”

Section: Introductionmentioning

confidence: 99%

Insertion rate and optimization of redundancy of constrained systems with unconstrained positions

Kamabe

2009

2009 IEEE International Symposium on Information Theory

View full text Add to dashboard Cite

Abstract-Immink and Cai have shown that the maxentropic bound for the Wijngaarden-Immink coding scheme is not tight. They have given simple bit-stuffing coding schemes whose code rates are greater than the bound. We analyze this problem in terms of finite state transition diagrams. Then we give a better bound of the code rate of the coding scheme and prove that our bound is better than the maxentropic bound when the insertion rate is 1/2.

show abstract

“…Let , , , and , denote the insertion rate, number of constrained positions, length of cycle label, and mean of the TMTR values of , respectively. (12) to obtain (13) Taking the supremum of both sides of inequality (13) over all cycles in that yield insertion rate , we obtain (14)…”

Section: A New Upper and Lower Bounds For The Tradeoff Function For mentioning

confidence: 99%

“…In Section IV, we present new upper bounds on the capacity of TMTR constraints and show that there is a complete linear chain of tight TMTR for vectors up to length ordered by capacity. Finally, in Section V, we show that for MTR constrained systems with unconstrained positions [13], [4], [11], the set of sequences restricted to the constrained positions yields a TMTR constraint. We also derive a new upper bound on the tradeoff function relating the density of unconstrained positions to the maximum code rates.…”

mentioning

confidence: 99%

Time-varying maximum transition run constraints

Poo

Marcus

2005

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.

View full text Add to dashboard Cite

Abstract-Maximum transition run (MTR) constrained systems are used to improve detection performance in storage channels. Recently, there has been a growing interest in time-varying MTR (TMTR) systems, after such codes were observed to eliminate certain error events and thus provide high coding gain for E n PR4 channels for n = 2; 3.In this work, TMTR constraints parameterized by a vector, whose coordinates specify periodically the maximum runlengths of 1's ending at the positions, are investigated. A canonical way to classify such constraints and simplify their minimal graph presentations is introduced. It is shown that there is a particularly simple presentation for a special class of TMTR constraints and explicit descriptions of their characteristic equations are derived. New upper bounds on the capacity of TMTR constraints are established, and an explicit linear ordering by capacity of all tight TMTR constraints up to period 4 is given. For MTR constrained systems with unconstrained positions, it is shown that the set of sequences restricted to the constrained positions yields a natural TMTR constraint. Using TMTR constraints, a new upper bound on the tradeoff function for MTR systems that relates the density of unconstrained positions to the maximum code rates is determined.

show abstract

Maximum runlength-limited codes with error control capabilities

Cited by 48 publications

References 11 publications

Reduction of nonlinear intrachannel effects by channel asymmetry in transmission lines with strong bit overlapping

Reduction of nonlinear intrachannel effects by channel asymmetry in transmission lines with strong bit overlapping

Insertion rate and optimization of redundancy of constrained systems with unconstrained positions

Time-varying maximum transition run constraints

Contact Info

Product

Resources

About