Technical Reports
HPL-2011-160
Click here for full text:
Low complexity two-dimensional weight-constrained codes
Ordentlich, Erik; Roth, Ron M.
HP Laboratories
HPL-2011-160
Keyword(s): Boolean lattice; resistive memory; two-dimensional coding; weight-constrained codes
Abstract: Two low complexity coding techniques are described for mapping arbitrary data to and from mxn binary arrays in which the Hamming weight of each row (respectively, column) is at most n/2 (respectively, m/2). One technique is based on flipping rows and columns of an arbitrary binary array until the Hamming weight constraint is satisfied in all rows and columns, and the other is based on a certain explicitly constructed "antipodal" matching between layers of the Boolean lattice. Both codes have a redundancy of roughly m+n and may have applications in next generation resistive memory technologies.
17 Pages
External Posting Date: September 21, 2011 [Fulltext]. Approved for External Publication
Internal Posting Date: September 21, 2011 [Fulltext]