T.T. Nguyen, K. Cai, K. A. Schouhamer Immink, Y. M. Chee, 'Efficient Design of Capacity-Approaching Two-Dimensional Weight-Constrained Codes',
IEEE International Symposium on Information Theory, (ISIT) 2021, Melbourne, June 2021.
Abstract - In this work, given n, p > 0, efficient encoding/decoding algorithms are presented for mapping arbitrary data to and from n x n binary arrays in which the weight of every row and every column is at most pn. Such constraint, referred as p-bounded-weight-
constraint, is crucial for reducing the parasitic currents in the crossbar resistive memory arrays, and has also been proposed for certain applications in the area of holographic memory in optical storage. While low-complexity designs have been proposed in the
literature for only the case p = 1/2, this work provides an efficient coding scheme that works for arbitrary values of p. The coding rate of our proposed encoder approaches the channel capacity for all p, particularly when p = 1/2, we are able to reduce the redundancy
of the best known encoder in the literature by at leasttheta(n) bits.
Articles, books, and book chapters (most recent first).