Name
Abstract | ||
|---|---|---|
A reverse concatenation coding scheme for storage systems in which the information is encoded first by a modulation (constraint) code and then by a systematic error-correcting code is considered. In this scheme, the output of the modulation coding stage has certain positions left “unconstrained” in the sense that any way of filling them with bits results in a sequence that satisfies the constraint. These positions are then used to store the parity-check bits of the error-correcting code so that the result is a valid constrained sequence. The tradeoff function defines the maximum overall rate of the encoding scheme for a given density of unconstrained positions. This function is determined for two families of run length limited (RLL) constraints: $\mathrm{RLL}(d,\infty)$ and $\mathrm{RLL}(d,2d+2)$. For $\mathrm{RLL}(d,2d+2)$, a curious dichotomy in the shape of the tradeoff function between different ranges of values of $d$ is shown to exist. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1137/090766887 | SIAM J. Discrete Math. |
Keywords | Field | DocType |
curious dichotomy,encoding scheme,tradeoff function,modulation coding stage,systematic error-correcting code,different range,unconstrained position,bits result,error-correcting code,certain position | Modulation coding,Run-length limited,Discrete mathematics,Combinatorics,Modulation,Error detection and correction,Coding (social sciences),Concatenation,Shape function,Mathematics,Encoding (memory) | Journal |
Volume | Issue | ISSN |
24 | 4 | 0895-4801 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Erez Louidor | 1 | 2 | 1.84 |