Name
Title | ||
|---|---|---|
Moment Balancing Templates for $(d,k)$-Constrained Codes and Run-Length Limited Sequences |
Abstract | ||
|---|---|---|
The first-order moment of $(d,k)$ -constrained codes is investigated in this paper. A generalized moment balancing template is proposed to encode a $(d,k)$ sequence into a single insertion or deletion correcting codeword without losing the constraint property. By relocating 0's in moment balancing runs, which appear in a pairwise manner of a $(d,k)$ sequence, the first-order moment of this sequence can be modified to satisfy the Varshamov–Tenengolts construction. With a reasonably large base in the modulo system introduced by the Varshamov–Tenengolts construction, this generalized moment balancing template can be applied to run-length limited sequences. The asymptotic bound of the redundancy introduced by the template for $(d,k)$ sequences is of the same order as the universal template for random sequences and, therefore, the redundancy is small and suitable for long sequences of practical interest. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1109/TIT.2011.2178089 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
binary codes,modulation,redundancy,error correction code,random sequence,first order,encoding,satisfiability | Pairwise comparison,Discrete mathematics,Run-length limited,Combinatorics,Computer science,Modulo,Binary code,Redundancy (engineering),Code word,Template,Encoding (memory) | Journal |
Volume | Issue | ISSN |
58 | 4 | 0018-9448 |
Citations | PageRank | References |
3 | 0.51 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cheng, L. | 1 | 51 | 10.93 |
| Hendrik C. Ferreira | 2 | 195 | 43.56 |
| Izak Broere | 3 | 143 | 31.30 |