Title :
Low Complexity Two-Dimensional Weight-Constrained Codes
Author :
Ordentlich, Erik ; Roth, Ron M.
Author_Institution :
Hewlett-Packard Labs., Palo Alto, CA, USA
fDate :
6/1/2012 12:00:00 AM
Abstract :
Two low complexity coding techniques are described for mapping arbitrary data to and from m × n 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.
Keywords :
Hamming codes; encoding; Boolean lattice; Hamming weight constraint; antipodal matching; arbitrary binary array; flipping columns; flipping rows; low complexity two-dimensional weight-constrained codes; next generation resistive memory technologies; Arrays; Complexity theory; Decoding; Encoding; Indexes; Redundancy; Resistance; Boolean lattice; resistive memory; two-dimensional coding; weight-constrained codes;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2012.2190380