Name
Abstract | ||
|---|---|---|
We present bit-stuffing schemes which encode arbitrary data sequences into two-dimensional (2-D) constrained arrays. We consider the class of 2-D runlength-limited (RLL) (d, infinity) constraints as well as the 'no isolated bits' (n.i.b.) constraint, both defined on the square lattice. The bit stuffing technique was previously introduced and applied to the class of 2-D (d, infinity) constraints. Analytical lower bounds on the rate of these encoders were derived. For d = 1, a more general scheme was analyzed and shown to obtain improved performance. We extend the (1, infinity)-construction to (d, infinity) constraints where d >= 2. We then suggest a bit-stuffing scheme for the n.i.b. constraint, based on a capacity-achieving scheme for a one-dimensional RLL (0, 3) constraint. Simulation results demonstrate the performance of the proposed schemes. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/ISIT.2005.1523589 | 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2 |
Keywords | Field | DocType |
binary codes,lower bound | Bit stuffing,Discrete mathematics,ENCODE,Combinatorics,Square lattice,Computer science,Binary code,Data sequences,Encoder | Conference |
Citations | PageRank | References |
1 | 0.37 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| S. Aviran | 1 | 14 | 4.08 |
| Paul H. Siegel | 2 | 1142 | 105.90 |
| Jack K. Wolf | 3 | 921 | 119.33 |